Skip to main content
SpringerLink
Log in

On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems

  • Conference paper
Algorithms and Computation (ISAAC 2005)

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

Included in the following conference series:

Abstract

In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V,E) with n vertices with a color (or label) function L : E→ {c 1,...,c q }, the labeled maximum matching problem consists in finding a maximum matching on G that uses a minimum or a maximum number of colors.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton cycles. Electron. J. Combin. 2 (1995) (Research Paper 10)

    Google Scholar 

  2. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science 237, 123–134 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Williamson, D.P.: Improved Approximation Algorithms for MAX SAT. Journal of Algorithms 42(1), 173–202 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation (Combinatorial Optimization Problems and Their Approximability Properties). Springer, Berlin (1999)

    MATH  Google Scholar 

  5. Berman, P., Karpinski, M., Scott, A.D.: Approximation Hardness of Short Symmetric Instances of MAX-3SAT. ECCC TR-03-049 (2003)

    Google Scholar 

  6. Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. ECCC TR-05-029 (1998)

    Google Scholar 

  7. Broersma, H., Li, X.: Spanning trees with many or few colors in edgecolored graphs. Discussiones Mathematicae Graph Theory 17(2), 259–269 (1997)

    MATH  MathSciNet  Google Scholar 

  8. Broersma, H., Li, X., Woeginger, G.J., Zhang, S.: Paths and cycles in colored graphs. Australasian J. Combin. 31 (2005)

    Google Scholar 

  9. Brüggemann, T., Monnot, J., Woeginger, G.J.: Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters 31(3), 195–201 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Cameron, K.: Coloured matchings in bipartite graphs. Discrete Mathematics 169, 205–209 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.V.: On the red-blue set cover problem. In: SODA, pp. 345–353 (2000)

    Google Scholar 

  12. Chang, R.-S., Leu, S.-J.: The minimum labeling spanning trees. Information Processing Letters 63, 277–282 (1997)

    Article  MathSciNet  Google Scholar 

  13. Costa, M.C., de Werra, D., Picouleau, C., Ries, B.: Bicolored matchings in some classes of graphs. Technical report (2004)

    Google Scholar 

  14. Erdös, P., Nešetřil, J., Rödl, V.: On some problems related to partitions of edges of a graph. In: Graphs and other combinatorial topics, Teubner, Leipzig, pp. 54–63 (1983)

    Google Scholar 

  15. Feige, U.: A threshold of for approximating set cover. J. ACM 45, 634–652 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Frieze, A., Reed, B.: Polychromatic Hamilton cycles. Discrete Math. 118, 69–74 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Karpinski, M.: Personnal communication (2005)

    Google Scholar 

  19. Krumke, S.O., Wirth, H.-C.: On the minimum label spanning tree problem. Information Processing Letters 66, 81–85 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  20. Marathe, M.V., Ravi, S.S.: On Approximation Algorithms for the Minimum Satisfiability Problem. Information Processing Letters 58(1), 23–29 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  21. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. of Comp. and Sys. Sci. 43, 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  22. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proc. 29th Ann. ACM Symp. on Theory of Comp., pp. 475–484. ACM, New York (1997)

    Google Scholar 

  23. Wan, Y., Chen, G., Xu, Y.: A note on the minimum label spanning tree. Information Processing Letters 84, 99–101 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  24. Xiong, Y., Golden, B., Wasil, E.: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem. Operations Research Letters 33(1), 77–80 (2005)

    Article  MATH  Google Scholar 

  25. Yi, T., Murty, K.G., Spera, C.: Matchings in colored bipartite networks. Discrete Applied Mathematics 121(1-3), 261–277 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jérôme Monnot

Authors
  1. Jérôme Monnot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monnot, J. (2005). On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_93

Download citation

  • DOI: https://doi.org/10.1007/11602613_93

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation