Worst case bounds for the Euclidean matching problem
From MaRDI portal
Publication:1149255
DOI10.1016/0898-1221(81)90084-5zbMath0453.68036OpenAlexW1969543582MaRDI QIDQ1149255
Publication date: 1981
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(81)90084-5
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items (4)
AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ New approximation results on graph matching and related problems ⋮ Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching ⋮ A partitioning algorithm for minimum weighted Euclidean matching
Cites Work
This page was built for publication: Worst case bounds for the Euclidean matching problem
