Publication:4234076
From MaRDI portal
zbMath0968.68531MaRDI QIDQ4234076
Santosh Vempala, Prasad Chalasani, Avrim L. Blum
Publication date: 27 August 2001
Related Items
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane, 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