Worst case bounds for the Euclidean matching problem

DOI10.1016/0898-1221(81)90084-5MaRDI QIDQ1149255zbMATH OpenOpenAlexFDO

Authors David Avis

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

zbMATH Keywords

sphere packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3664381 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3799403 (Why is no real title available?)
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• On a Greedy Heuristic for Complete Matching

Cited in

(4)

• Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
• AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
• New approximation results on graph matching and related problems
• A partitioning algorithm for minimum weighted Euclidean matching

This page was built for publication: Worst case bounds for the Euclidean matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149255)