Engineering Algorithms for Approximate Weighted Matching
- 26 June 2007
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A linear-time approximation algorithm for weighted matchings in graphsACM Transactions on Algorithms, 2005
- A simple approximation algorithm for the weighted matching problemInformation Processing Letters, 2002
- Computing Minimum-Weight Perfect MatchingsINFORMS Journal on Computing, 1999
- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General GraphsLecture Notes in Computer Science, 1999
- A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithmCombinatorica, 1994
- Faster scaling algorithms for general graph matching problemsJournal of the ACM, 1991
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General GraphsSIAM Journal on Computing, 1986
- A survey of heuristics for the weighted matching problemNetworks, 1983
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965