Minimum shared‐power edge cut
From MaRDI portal
Publication:6066053
DOI10.1002/net.21928arXiv1806.04742OpenAlexW3005307550MaRDI QIDQ6066053
Sergio Cabello, Anna Lubiw, Kshitij Jain, Debajyoti Mondal
Publication date: 15 November 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.04742
wireless network\(s\)-\(t\) cutbarrier coveragefully polynomial-time approximation schemeactivation network
Related Items (4)
Finding a Maximum Clique in a Grounded 1-Bend String Graph ⋮ Minimum cuts in geometric intersection graphs ⋮ Hardness of minimum barrier shrinkage and minimum installation path ⋮ Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
Cites Work
- Unnamed Item
- Unnamed Item
- Survivable network activation problems
- Union of random Minkowski sums and network vulnerability analysis
- Approximating minimum power edge-multi-covers
- Power optimization for connectivity problems
- On maximum flows in polyhedral domains
- On minimum power connectivity problems
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- On the complexity of barrier resilience for fat regions and bounded ply
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Exposure in wireless sensor networks: Theory and practical solutions
- Coverage problems in sensor networks
- An optimal minimum spanning tree algorithm
- Min-Power Covering Problems
- Algorithmic Aspects of Graph Connectivity
- Maximal flow through a domain
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- A randomized linear-time algorithm to find minimum spanning trees
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
- An $o(n^3 )$-Time Maximum-Flow Algorithm
This page was built for publication: Minimum shared‐power edge cut
