Randomized and approximation algorithms for blue-red matching

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Nomikos, C., Pagourtzis, A., & Zachos, S. (2007). Randomized and approximation algorithms for blue-red matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 715–725). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free