Improved Linear Time Approximation Algorithms for Weighted Matchings
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A simple approximation algorithm for the weighted matching problemInformation Processing Letters, 2002
- Quality matching and local improvement for multilevel graph-partitioningParallel Computing, 2000
- Complexity and Modeling Aspects of Mesh Refinement into QuadrilateralsAlgorithmica, 2000
- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General GraphsLecture Notes in Computer Science, 1999
- A survey of heuristics for the weighted matching problemNetworks, 1983
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965