On the Bounded-Hop Range Assignment Problem

DOI10.1007/978-3-319-21840-3_12zbMath1444.90075OpenAlexW1189745894MaRDI QIDQ3449812

Lilach Chaitman-Yerushalmi, Paz Carmi, Ohad Trabelsi

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_12

Mathematics Subject Classification ID

Continuous location (90B85) Combinatorial optimization (90C27) Approximation algorithms (68W25)

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
• Connecting a set of circles with minimum sum of radii
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• 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
• IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS
• On the Minimum Cost Range Assignment Problem

This page was built for publication: On the Bounded-Hop Range Assignment Problem