arXiv (All)
open access
Almost Lossless Transfer for Cuttable Distributed Problems
We study constant-round LOCAL approximation for additive local vertex-subset minimization problems. Given a $k$-uniform $α$-approximation on a hereditary source class closed under disjoint union, Bonamy, Das, Gavoille, Picavet, Suomela, and Wesolek obtained ratio $α(d+1)+1$ on locally nice target cl
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 (In)Approximability of the Monitoring Edge Geodetic Set Problem#1328304
- A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments#1122732
- Characterizing optimal monitoring edge-geodetic sets for some structured graph classes#14161
- A Deterministic Near-Linear Time Approximation Algorithm for Restricted Shortest Paths in Directed Graphs#1343850
- Improved Integrality Gap for Multicommodity Flow on Trees#985353
Record · ID 1326846
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