Randomized And Approximation Algorithms For Blue-Red Matching
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS(2007)
摘要
We introduce the BLUE-RED MATCHING problem: given a graph with red and blue edges, and a bound omega, 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.
更多查看译文
关键词
Blue-Red Matching problem,problem Exact Matching,Blue-Red Matching,bound w,maximum matching,maximum number,w edge,RNC algorithm,all-optical ring,assigning wavelength,approximation algorithm,blue-red matching
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要