Computational geometry: an introduction
Computational geometry: an introduction
A lower bound to the complexity of Euclidean and rectilinear matching algorithms
Information Processing Letters
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Heuristics for weighted perfect matching
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
A greedy heuristic for a minimum-weight forest problem
Operations Research Letters
Reordering rows for better compression: Beyond the lexicographic order
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The minimum-weight perfect matching problem for complete graphs of n vertices with edge weights satisfying the triangle inequality is considered. For each nonnegative integer k ≤ log3n, and for any perfect matching algorithm that runs in t(n) time and has an error bound of ƒ(n) times the optimal weight, an O(max{n2, t(3-kn)})-time heuristic algorithm with an error bound of (7/3)k(1 + ƒ(3 kn)) - 1 is given. By the selection of k as appropriate functions of n, heuristics that have better running times and/or error bounds than existing ones are derived.