arXiv (All)
open access
Routing Optimality for Demand Graphs of Matching Number at Most Two
We prove that network coding and fractional routing have the same capacity region in undirected networks whose demand graph has matching number at most two, that is, when no three demand edges have pairwise disjoint endpoints. The metric-packing reduction of Liu et al. reduces this problem to a dist
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
- The Hardness of Dominant Strategy Mechanism Design, Revisited#1215859
- Extension of Excess Demand Ascending Auction to Multi-Demand Model by Discrete Convex Analysis Approach#971798
- An Exact Counterexample to Affine-Like Price-of-Anarchy Shape in Quartic BPR Routing#1062080
- On the exact quantum chromatic number of generalized Johnson graphs#927944
- Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs#665588
Record · ID 1343110
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