Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Combinatorial Optimization

ISCO 2012: Combinatorial Optimization pp 344–355Cite as

Constrained Matching Problems in Bipartite Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7422))

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.

Supported by the Swiss National Science Foundation Project N.200020-122110/1 “Approximation Algorithms for Machine Scheduling Through Theory and Experiments III” and by Hasler foundation Grant 11099.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bampas, E., Pagourtzis, A., Potika, K.: An experimental study of maximum profit wavelength assignment in wdm rings. Networks 57(3), 285–293 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39(4), 1413–1431 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berger, A., Bonifaci, V., Grandoni, F., Schäfer, G.: Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 273–287. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Caragiannis, I.: Wavelength Management in WDM Rings to Maximize the Number of Connections. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 61–72. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Carrabs, F., Cerulli, R., Gentili, M.: The labeled maximum matching problem. Computers & OR 36(6), 1859–1871 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chekuri, C., Vondrák, J., Zenklusen, R.: Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. In: SODA (2011)

    Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)

    Google Scholar 

  8. Grandoni, F., Ravi, R., Singh, M.: Iterative Rounding for Multi-Objective Optimization Problems. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 95–106. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Grandoni, F., Zenklusen, R.: Optimization with more than one budget. CoRR abs/1002.2147 (2010)

    Google Scholar 

  10. Itai, A., Rodeh, M.: Some Matching Problems. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 52, pp. 258–268. Springer, Heidelberg (1977)

    Chapter  Google Scholar 

  11. Itai, A., Rodeh, M., Tanimoto, S.L.: Some matching problems for bipartite graphs. J. ACM 25(4), 517–525 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lau, L. C., Ravi, R., and Singh, M. Iterative Methods in Combinatorial Optimization. Cambridge University Press (2011)

    Google Scholar 

  13. Monnot, J.: The labeled perfect matching in bipartite graphs. Inf. Process. Lett. 96(3), 81–88 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Monnot, J.: On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 934–943. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: IEEE INFOCOM (2003)

    Google Scholar 

  16. Nomikos, C., Pagourtzis, A., Zachos, S.: Randomized and Approximation Algorithms for Blue-Red Matching. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 715–725. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Schrijver, A. Theory of Linear and Integer Programming. John Wiley & sons (1998)

    Google Scholar 

  18. Singh, M. Iterative Methods in Combinatorial Optimization. PhD thesis, Carnegie Mellon University (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IDSIA, Manno-Lugano, Switzerland

    Monaldo Mastrolilli & Georgios Stamoulis

Authors
  1. Monaldo Mastrolilli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georgios Stamoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    A. Ridha Mahjoub  & Vangelis Th. Paschos  & 

  2. Department of Informatics, Athens University of Economics and Business, 76 Patission str., 10434, Athens, Greece

    Vangelis Markakis  & Ioannis Milis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mastrolilli, M., Stamoulis, G. (2012). Constrained Matching Problems in Bipartite Graphs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation