Approximating the degree-bounded minimum diameter spanning tree problem

DOI10.1007/S00453-004-1121-2zbMATH Open1082.68085OpenAlexW1999760725MaRDI QIDQ1763151FDOQ1763151

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

Recommendations

• Approximating the degree-bounded minimum diameter spanning tree problem
• A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
• A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
• Finding bounded diameter minimum spanning tree in general graphs
• scientific article; zbMATH DE number 742978

Mathematics Subject Classification ID

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

Cited In (20)

• Bounded-degree minimum-radius spanning trees in wireless sensor networks
• Approximating minimum-cost graph problems with spanning tree edges
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
• Degree-bounded minimum spanning trees
• Bounded-degree light approximate shortest-path trees in doubling metrics
• Cooperative TSP
• An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Near-optimal bounded-degree spanning trees
• Hardness and efficiency on minimizing maximum distances in spanning trees
• Degree-bounded minimum spanning tree for unit disk graph
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• Broadcasting a file in a communication network
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• A unifying model for locally constrained spanning tree problems
• Title not available (Why is that?)
• The maximum degree \& diameter-bounded subgraph and its applications
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• Approximating the degree-bounded minimum diameter spanning tree problem

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

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