On the bounded-hop range assignment problem

DOI10.1007/978-3-319-21840-3_12MaRDI QIDQ3449812zbMATH OpenOpenAlexFDO

Authors Paz Carmi, Lilach Chaitman-Yerushalmi, 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

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

Recommendations

• Bounded-hop communication networks
• The minimum range assignment problem on linear radio networks
• scientific article; zbMATH DE number 1500550
• On the minimum cost range assignment problem
• Assign ranges in general ad-hoc networks

Cites work

• Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
• Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
• Bounded-hops power assignment in ad hoc wireless networks
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• scientific article; zbMATH DE number 1670654 (Why is no real title available?)
• scientific article; zbMATH DE number 2089212 (Why is no real title available?)
• scientific article; zbMATH DE number 3997615 (Why is no real title available?)
• IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS
• Minimum-cost coverage of point sets by disks
• On the approximability of the range assignment problem on radio networks in presence of selfish agents
• On the minimum cost range assignment problem
• Polynomial time approximation schemes for base station coverage with minimum total radii
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.

Cited in

(10)

• Power consumption in packet radio networks
• The minimum broadcast range assignment problem on linear multi-hop wireless networks.
• On the bounded-hop MST problem on random Euclidean instances
• scientific article; zbMATH DE number 1670654 (Why is no real title available?)
• On the minimum cost range assignment problem
• Homogeneous 2-Hops Broadcast in 2D
• Power consumption in packet radio networks (extended abstract)
• Structural Information and Communication Complexity
• A PTAS for k-hop MST on the Euclidean plane: improving dependency on k
• Power assignment in radio networks with two power levels

This page was built for publication: On the bounded-hop range assignment problem

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