The minimum range assignment problem on linear ratio networks. (Extended abstract)
From MaRDI portal
Recommendations
- The minimum range assignment problem on linear radio networks
- scientific article; zbMATH DE number 558538
- An improved approximation ratio for the minimum linear arrangement problem
- The minimum broadcast range assignment problem on linear multi-hop wireless networks.
- On the minimum cost range assignment problem
- IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS
- Improved algorithm for minimum cost range assignment problem for linear radio networks
- On the bounded-hop range assignment problem
- The constrained minimax linear assignment problem
- Approximation algorithms for degree-constrained minimum-cost network-design problems
Cited in
(12)- The minimum range assignment problem on linear radio networks
- Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements
- The minimum broadcast range assignment problem on linear multi-hop wireless networks.
- Two new algorithms for the min-power broadcast problem in static ad hoc networks
- Bounded-hops power assignment in ad hoc wireless networks
- Assign ranges in general ad-hoc networks
- Submodular formulations for range assignment problems
- On the bounded-hop range assignment problem
- scientific article; zbMATH DE number 558538 (Why is no real title available?)
- Power assignment in radio networks with two power levels
- Assign ranges in general ad-hoc networks
- Minimum power assignment in wireless ad hoc networks with spanner property
This page was built for publication: The minimum range assignment problem on linear ratio networks. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753931)