Theory of linear and integer programming
Theory of linear and integer programming
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The labeled maximum matching problem
Computers and Operations Research
The labeled perfect matching in bipartite graphs
Information Processing Letters
Wavelength management in WDM rings to maximize the number of connections
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Additive Guarantees for Degree-Bounded Directed Network Design
SIAM Journal on Computing
Iterative Methods in Combinatorial Optimization
Iterative Methods in Combinatorial Optimization
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Randomized and approximation algorithms for blue-red matching
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We study the following generalization of maximum matchings in bipartite graphs: given a bipartite graph such that each edge has a unique color cj, we are asked to find a maximum matching that has no more than wj edges of color cj. 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.