1.61-approximation for min-power strong connectivity with two power levels
From MaRDI portal
Publication:5963620
Recommendations
Cites work
- scientific article; zbMATH DE number 3904590 (Why is no real title available?)
- scientific article; zbMATH DE number 2079404 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- Approximate min-power strong connectivity
- Approximating the Minimum Equivalent Digraph
- Approximating the minimum strongly connected subgraph via a matching lower bound
- Color-coding
- Energy-efficient wireless network design
- Faster Algebraic Algorithms for Path and Packing Problems
- Improved algorithms for path, matching, and packing problems
- Introduction to algorithms.
- Matching theory
- Min-power strong connectivity
- Network lifetime and power assignment in ad hoc wireless networks
- On min-power Steiner tree
- On strongly connected digraphs with bounded cycle length
- On the graphic matroid parity problem
- Power assignment in radio networks with two power levels
- Wireless network design via 3-decompositions
Cited in
(3)
This page was built for publication: 1.61-approximation for min-power strong connectivity with two power levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963620)