Skip to main content
SpringerLink
Log in

Approximate Matching

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 145 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Recommended Reading

  1. Christofides N, GROUP CMUPPMSR (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Defense Technical Information Center, http://books.google.de/books?id=2A7eygAACAAJ

  2. Coppersmith D, Winograd T (1987) Matrix multiplication via arithmetic progressions. In: Proceedings of 19th ACM symposium on the theory of computing (STOC), New York, pp 1–6

    Google Scholar 

  3. Drake D, Hougardy S (2003) A simple approximation algorithm for the weighted matching problem. Inf Process Lett 85:211–213

    Article  MathSciNet  MATH  Google Scholar 

  4. Duan R, Pettie S (2010) Approximating maximum weight matching in near-linear time. In: Proceedings 51st IEEE symposium on foundations of computer science (FOCS), Las Vegas, pp 673–682

    Google Scholar 

  5. Duan R, Pettie S (2014) Linear-time approximation for maximum weight matching. J ACM 61(1):1:1–1:23. doi:10.1145/2529989, http://doi.acm.org/10.1145/2529989

  6. Edmonds J (1965) Maximum matching and a polyhedron with 0, 1-vertices. J Res Nat Bur Stand Sect B 69B:125–130

    Article  MathSciNet  MATH  Google Scholar 

  7. Edmonds J (1965) Paths, trees, and flowers. Can J Math 17:449–467

    Article  MathSciNet  MATH  Google Scholar 

  8. Gabow HN, Tarjan RE (1989) Faster scaling algorithms for network problems. SIAM J Comput 18(5):1013–1036

    Article  MathSciNet  MATH  Google Scholar 

  9. Gabow HN, Tarjan RE (1991) Faster scaling algorithms for general graph-matching problems. J ACM 38(4):815–853

    Article  MathSciNet  MATH  Google Scholar 

  10. Hopcroft JE, Karp RM (1973) An \(n^{5/2}\) algorithm for maximum matchings in bipartite graphs. SIAM J Comput 2:225–231

    Article  MathSciNet  MATH  Google Scholar 

  11. Huang CC, Kavitha T (2012) Efficient algorithms for maximum weight matchings in general graphs with small edge weights. In: Proceedings of the twenty-third annual ACM-SIAM symposium on discrete algorithms, SODA’12, Kyoto. SIAM, pp 1400–1412. http://dl.acm.org/citation.cfm?id=2095116.2095226

    Chapter  Google Scholar 

  12. Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2:83–97

    Article  MathSciNet  MATH  Google Scholar 

  13. Mestre J (2006) Greedy in approximation algorithms. In: Proceedings of the 14th conference on annual European symposium, Zurich, vol 14. Springer, London, pp 528–539. doi:10.1007/11841036_48, http://portal.acm.org/citation.cfm?id=1276191.1276239

  14. Micali S, Vazirani V (1980) An \(O(\sqrt{\vert V \vert }\cdot \vert E\vert )\) algorithm for finding maximum matching in general graphs. In: Proceedings of 21st IEEE symposium on foundations of computer science (FOCS), Syracuse, pp 17–27

    Google Scholar 

  15. Mucha M, Sankowski P (2004) Maximum matchings via Gaussian elimination. In: Proceedings of 45th symposium on foundations of computer science (FOCS), Rome, pp 248–255

    Google Scholar 

  16. Pettie S, Sanders P (2004) A simpler linear time \(2/3-\epsilon\) approximation to maximum weight matching. Inf Process Lett 91(6):271–276

    Article  MathSciNet  MATH  Google Scholar 

  17. Preis R (1999) Linear time 1∕2-approximation algorithm for maximum weighted matching in general graphs. In: Proceedings of 16th symposium on theoretical aspects of computer science (STACS), Trier. LNCS, vol 1563, pp 259–269

    Google Scholar 

  18. Sankowski P (2006) Weighted bipartite matching in matrix multiplication time. In: Proceedings of 33rd international symposium on automata, languages, and programming (ICALP), Venice, pp 274–285

    Google Scholar 

  19. Vinkemeier DED, Hougardy S (2005) A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans Algorithms 1(1):107–122

    Article  MathSciNet  MATH  Google Scholar 

  20. Williams VV (2012) Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of the 44th symposium on theory of computing, STOC’12, New York. ACM, New York, pp 887–898. doi:10.1145/2213977.2214056http://doi.acm.org/10.1145/2213977.2214056

Download references

Author information

Authors and Affiliations

  1. Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China

    Ran Duan

Authors
  1. Ran Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ran Duan .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Duan, R. (2016). Approximate Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_570

Download citation

Publish with us

Policies and ethics

Search

Navigation