A generalized hypergreedy algorithm for weighted perfect matching
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4045188
- A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors
- A survey of heuristics for the weighted matching problem
- A new class of heuristic algorithms for weighted perfect matching
- On the existence of weak greedy matching heuristics
Cites work
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms
- A new class of heuristic algorithms for weighted perfect matching
- Approximate minimum weight matching on points in k-dimensional space
- Classes of graphs which approximate the complete Euclidean graph
- Delaunay graphs are almost as good as complete graphs
- Fast Matching Algorithms for Points on a Polygon
- Heuristic matching for graphs satisfying the triangle inequality
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Introduction to algorithms.
- Paths, Trees, and Flowers
Cited in
(9)- A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors
- New primal and dual matching heuristics
- A survey of heuristics for the weighted matching problem
- scientific article; zbMATH DE number 4025481 (Why is no real title available?)
- scientific article; zbMATH DE number 4045188 (Why is no real title available?)
- A new class of heuristic algorithms for weighted perfect matching
- An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane
- scientific article; zbMATH DE number 6866348 (Why is no real title available?)
- An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
This page was built for publication: A generalized hypergreedy algorithm for weighted perfect matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688623)