Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems

DOI10.1016/j.jda.2008.11.006zbMath1187.68348OpenAlexW2006099085MaRDI QIDQ1026247

David Peleg, Erez Kantor

Publication date: 24 June 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.11.006

zbMATH Keywords

facility locationapproximation algorithmsSteiner treeswireless networksrange assignment

Mathematics Subject Classification ID

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

Related Items (8)

A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ On the Bounded-Hop Range Assignment Problem ⋮ Minimizing energies with hierarchical costs ⋮ An approximation algorithm for the \(k\)-level concentrator location problem ⋮ Multi-level facility location problems ⋮ Bounded-hop communication networks ⋮ Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the weight of shallow Steiner trees
• The minimum range assignment problem on linear radio networks
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• Approximating \(k\)-hop minimum-spanning trees
• On the hardness of approximating minimization problems
• Power consumption in packet radio networks

This page was built for publication: Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems