Faster geometric k-point MST approximation

DOI10.1016/S0925-7721(96)00021-1MaRDI QIDQ1370933zbMATH OpenOpenAlexFDO

Authors David Eppstein

Publication date 28 October 1997

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(96)00021-1

zbMATH Keywords

minimum spanning tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1263205
• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
• Publication:4952696

Cites work

• scientific article; zbMATH DE number 1003287 (Why is no real title available?)
• scientific article; zbMATH DE number 1256763 (Why is no real title available?)
• scientific article; zbMATH DE number 1263203 (Why is no real title available?)
• scientific article; zbMATH DE number 1263205 (Why is no real title available?)
• scientific article; zbMATH DE number 1163704 (Why is no real title available?)
• scientific article; zbMATH DE number 871938 (Why is no real title available?)
• An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane
• Iterated nearest neighbors and finding minimal polytopes
• Parallel construction of quadtrees and quality triangulations
• Static and dynamic algorithms for k-point clustering problems
• Steiner Minimal Trees

Cited in

(4)

• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
• Fast geometric approximation techniques and geometric embedding problems
• Local search algorithms for the \(k\)-cardinality tree problem.
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

This page was built for publication: Faster geometric \(k\)-point MST approximation

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