scientific article; zbMATH DE number 1263205

MaRDI QIDQ4234076zbMATH OpenFDO

Authors Prasad Chalasani, Avrim Blum, Santosh S. Vempala

Publication date 27 August 2001

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A constant-factor approximation algorithm for the \(k\)-MST problem
• scientific article; zbMATH DE number 1256763
• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
• A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane

Cited in

(14)

• An improved approximation ratio for the minimum latency problem
• A constant-factor approximation algorithm for the \(k\)-MST problem
• Faster geometric \(k\)-point MST approximation
• Compact location problems
• Local search algorithms for the \(k\)-cardinality tree problem.
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• An O( k) approximation algorithm for the k minimum spanning tree problem in the plane
• A 2.5-factor approximation algorithm for the k-MST problem
• scientific article; zbMATH DE number 1256763 (Why is no real title available?)
• A Constant-Factor Approximation Algorithm for the Geometrick-MST Problem in the Plane
• scientific article; zbMATH DE number 2038709 (Why is no real title available?)
• scientific article; zbMATH DE number 871938 (Why is no real title available?)
• Complexity and approximability of certain bicriteria location problems
• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane

This page was built for publication:

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