Deutsche Nationalbibliothek
metadata only
Approximation and Hardness Results for the Parallel-Block Construction Problem / Arivarasan Karmegam, Alexandru Popa, Lucianna Kiffer, Antonio Fernández Anta
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs *#796467
- Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation#1234335
- Faster high-accuracy multicommodity flow in dense graphs#1215758
- Algorithmic Lower Bounds: Fun with Hardness Proofs#3416
- Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane#1051626
Record · ID 1188461
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive