Bounded-hop communication networks

DOI10.1007/s00453-017-0370-9zbMath1410.68366OpenAlexW2753962647MaRDI QIDQ1755730

Ohad Trabelsi, Paz Carmi, Lilach Chaitman-Yerushalmi

Publication date: 11 January 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0370-9

zbMATH Keywords

computational geometryapproximation algorithmswireless networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ Minimizing the sum of distances to a server in a constraint network ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
• Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
• The minimum range assignment problem on linear radio networks
• Connecting a set of circles with minimum sum of radii
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Bounded-hops power assignment in ad hoc wireless networks
• On the approximability of the range assignment problem on radio networks in presence of selfish agents

This page was built for publication: Bounded-hop communication networks