arXiv (All)
open access
Remote Matching: Exact-Cardinality Approximation and Tight UGC Hardness
In the unrestricted max--min metric $T$-join problem, one seeks an even terminal set $T$ maximizing the cost of a minimum $T$-join. Iwata and Ravi gave a factor-$3/2$ approximation for this problem. We show that this guarantee is tight under the Unique Games Conjecture: no polynomial-time approximat
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
- Fair equality of chances for prediction-based decisions#706235
- Simple “Market Value” Bargaining Model for Weighted Voting Games: Characterization and Limit Theorems#942107
- Comparison of Deterministic Information Providers#1012871
- Procedural Fairness in Exchange Matching Systems#98615
- Team reasoning and a measure of mutual advantage in games#743970
Record · ID 1062558
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