Abstract

We study the following generalization of maximum matchings in bipartite graphs: given a bipartite graph such that each edge has a unique color c j , we are asked to find a maximum matching that has no more than w j edges of color c j . We study bi-criteria approximation algorithms for this problem based on linear programming techniques and we show how we can obtain a family of algorithms with varying performance guarantees that can violate the color bounds. Our problem is motivated from network problems in optical fiber technologies.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call