Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
From MaRDI portal
Recommendations
Cited in
(9)- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Approximation algorithms for the Euclidean bipartite TSP
- scientific article; zbMATH DE number 1003267 (Why is no real title available?)
- A Monte Carlo solution to the minimal Euclidean matching
- Euclidean matching problems and the metropolis algorithm
- On the weighted Euclidean matching problem in Rd
- scientific article; zbMATH DE number 1446757 (Why is no real title available?)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- An approximation algorithm for minimum-cost vertex-connectivity problems
This page was built for publication: Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888174)