On minimum power connectivity problems
From MaRDI portal
Publication:972357
DOI10.1016/J.JDA.2009.03.002zbMATH Open1186.90025OpenAlexW2034019057MaRDI QIDQ972357FDOQ972357
Authors: Yuval Lando, Zeev Nutov 
Publication date: 25 May 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.03.002
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- An application of submodular flows
- Title not available (Why is that?)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- The dense \(k\)-subgraph problem
- Biconnectivity approximations and graph carvings
- Title not available (Why is that?)
- Rooted \(k\)-connections in digraphs
- Power consumption in packet radio networks
- Approximating node connectivity problems via set covers
- Network lifetime and power assignment in ad hoc wireless networks
- Power optimization for connectivity problems
- Matroid Intersection
- Title not available (Why is that?)
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- An almost \(O(\log k)\)-approximation for \(k\)-connected subgraphs
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximating Minimum-Power Degree and Connectivity Problems
- Power assignment for \(k\)-connectivity in wireless ad hoc networks
- Approximating Steiner Networks with Node Weights
- Energy-efficient wireless network design
- On rooted node-connectivity problems
Cited In (18)
- Minimum shared‐power edge cut
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Power Optimization for Connectivity Problems
- Min-power strong connectivity
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
- Parameterized complexity of min-power asymmetric connectivity
- Approximation algorithms for minimum power \(k\) backbone node \(r\)-connected subgraph problem in wireless sensor networks
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximate min-power strong connectivity
- Minimum power partial multi-cover on a line
- On Minimum Power Connectivity Problems
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Improved approximation algorithms for minimum power covering problems
- Construction of minimum power 3-connected subgraph with \(k\) backbone nodes in wireless sensor networks
- Survivable network activation problems
- 1.61-approximation for min-power strong connectivity with two power levels
- Approximating minimum power edge-multi-covers
This page was built for publication: On minimum power connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972357)
