scientific article; zbMATH DE number 1263205

zbMath0968.68531MaRDI QIDQ4234076

Prasad Chalasani, Avrim L. Blum, Santosh Vempala

Publication date: 27 August 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (9)

A 2.5-factor approximation algorithm for the \(k\)-MST problem ⋮ Faster geometric \(k\)-point MST approximation ⋮ Compact location problems ⋮ Complexity and approximability of certain bicriteria location problems ⋮ An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Local search algorithms for the \(k\)-cardinality tree problem. ⋮ An improved approximation ratio for the minimum latency problem ⋮ A constant-factor approximation algorithm for the \(k\)-MST problem

This page was built for publication: