Randomized and Approximation Algorithms for Blue-Red Matching
From MaRDI portal
Publication:3525614
DOI10.1007/978-3-540-74456-6_63zbMath1147.68872OpenAlexW1504633543MaRDI QIDQ3525614
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_63
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (5)
Stathis Zachos at 70! ⋮ Integrality gaps for colorful matchings ⋮ Minimum <scp>color‐degree</scp> perfect b‐matchings ⋮ Unnamed Item ⋮ Bi-criteria and approximation algorithms for restricted matchings
This page was built for publication: Randomized and Approximation Algorithms for Blue-Red Matching