Randomized and Approximation Algorithms for Blue-Red Matching
We introduce the Blue-Red Matching problem: given a graph with red and blue edges, and a bound w, find a maximum matching consisting of at most w edges of each color. We show that Blue-Red Matching is at least as hard as the problem Exact Matching (Papadimitriou and Yannakakis, 1982), for which it is still open whether it can be solved in polynomial time. We present an RNC algorithm for this problem as well as two fast approximation algorithms. We finally show the applicability of our results to the problem of routing and assigning wavelengths to a maximum number of requests in all-optical rings.
Unable to display preview. Download preview PDF.
- 9.Micali, S., Vazirani, V.V.: An O(n 2.5) Algorithm for Maximum Matching in General Graphs. In: Proceedings Twenty-first Annual Symposium on the Foundations of Computer Science, pp. 17–27 (1980)Google Scholar
- 12.Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing Request Blocking in All-Optical Rings. In: Proceedings INFOCOM 2003, pp. 1771–1780 (2003)Google Scholar
- 15.Stamoulis, G.: Maximum Matching Problems with Constraints (in Greek). Diploma Thesis, Department of Computer Science, University of Ioannina (2006)Google Scholar