Approximating the degree-bounded minimum diameter spanning tree problem

DOI10.1007/s00453-004-1121-2zbMath1082.68085OpenAlexW1999760725MaRDI QIDQ1763151

Asaf Levin, Jochen Könemann, Amitabh Sinha

Publication date: 21 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/41348

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (6)

The maximum degree \& diameter-bounded subgraph and its applications ⋮ Broadcasting a file in a communication network ⋮ Bounded-degree minimum-radius spanning trees in wireless sensor networks ⋮ Cooperative TSP ⋮ A unifying model for locally constrained spanning tree problems ⋮ An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem

This page was built for publication: Approximating the degree-bounded minimum diameter spanning tree problem