Bounded-degree minimum-radius spanning trees in wireless sensor networks

DOI10.1016/J.TCS.2013.05.033zbMath1296.68107OpenAlexW2023062785MaRDI QIDQ391199

Dung T. Huynh, Min Kyung An, Trac N. Nguyen, Nhat X. Lam

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.033

zbMATH Keywords

disk graphbicriteria approximationbounded-degree spanning treebounded-diameter spanning treebounded-radius spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Vertex degrees (05C07)

Related Items (1)

On solving bi-objective constrained minimum spanning tree problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimum diameter spanning tree problem
• Approximating the degree-bounded minimum diameter spanning tree problem
• A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
• Approximating minimum bounded degree spanning trees to within one of optimal
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimum Diameter Spanning Trees and Related Problems
• Hamilton Paths in Grid Graphs
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Bounded-degree minimum-radius spanning trees in wireless sensor networks