Randomized and Approximation Algorithms for Blue-Red Matching

DOI10.1007/978-3-540-74456-6_63zbMATH Open1147.68872OpenAlexW1504633543MaRDI QIDQ3525614FDOQ3525614

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Title not available (Why is that?)
• Bi-criteria and approximation algorithms for restricted matchings
• Stathis Zachos at 70!
• Minimum <scp>color‐degree</scp> perfect b‐matchings
• Title not available (Why is that?)
• Integrality gaps for colorful matchings

   Recommendations

• Constrained Matching Problems in Bipartite Graphs 👍 👎
• Bi-criteria and approximation algorithms for restricted matchings 👍 👎
• Random bichromatic matchings 👍 👎
• Almost Exact Matchings 👍 👎
• Almost exact matchings 👍 👎

This page was built for publication: Randomized and Approximation Algorithms for Blue-Red Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525614)