Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.
Masao IriKazuo MurotaShouichi MatsuiPublished in: Inf. Process. Lett. (1981)
Keyphrases
- approximation algorithms
- minimum weight
- maximum cardinality
- worst case
- np hard
- greedy heuristic
- special case
- spanning tree
- bipartite graph
- minimum cost
- vertex cover
- undirected graph
- greedy algorithm
- randomized algorithms
- constant factor
- approximation ratio
- minimum spanning tree
- weighted graph
- constant factor approximation
- precedence constraints