arXiv (All)
open access
Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation
We consider a matching problem in which the cost of each edge is a vector with $k$ components. The cost of a matching is the sum of the bottlenecks over all components, and we ask whether there is a perfect matching of cost at most some value $Z$. This type of matching has applications in heavily sy
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
- Exact Optimal Transport by Matching#1199359
- Iterated Exact and Heuristic Algorithms for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Constraints#210381
- A Faster Auction Algorithm for Weighted Matroid Intersection#1155855
- Colored Interaction-Profile Realization: Complexity of Matching-Match on Spiders#1083584
- Combinatorial Optimization#66996
Record · ID 1202530
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