Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
From MaRDI portal
Publication:2922649
DOI10.1007/978-3-662-44465-8_53zbMath1426.68308OpenAlexW421361919MaRDI QIDQ2922649
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_53
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope ⋮ Integrality gaps for colorful matchings ⋮ Unnamed Item
This page was built for publication: Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
