Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching.
Stefan HougardyKarolina TammemaaPublished in: CoRR (2024)
Keyphrases
- approximation algorithms
- minimum weight
- maximum cardinality
- np hard
- spanning tree
- minimum cost
- bipartite graph
- greedy heuristic
- special case
- worst case
- vertex cover
- weighted graph
- minimum spanning tree
- constant factor
- undirected graph
- randomized algorithms
- precedence constraints
- approximation ratio
- tree patterns
- evolutionary algorithm
- euclidean distance
- linear programming
- constant factor approximation