Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/dual-based-approximation-algorithms-for-cut-based-network-connectivity-CH6DoKb2Rq
References (17)
-
G Călinescu (2013)
Approximate min-power strong connectivitySIAM J. Discret. Math., 27
-
NX Lam, TN Nguyen, MK An, DT Huynh (2015)
Dual power assignment optimization and fault tolerance in wsnsJ. Comb. Optim., 30
-
W-T Chen, N-F Huang (1989)
The strongly connecting problem on multihop packet radio networksIEEE Trans. Commun., 37
-
S Khuller, U Vishkin (1994)
Biconnectivity approximations and graph carvingsJ. ACM, 41
-
P Carmi, MJ Katz (2007)
Power assignment in radio networks with two power levelsAlgorithmica, 47
-
G Călinescu, S Kapoor, A Olshevsky, A Zelikovsky (2003)
Algorithms–ESA 2003 -
MR Garey, DS Johnson (1979)
Computers and Intractability: A Guide to the Theory of NP-Completeness -
HN Gabow, MX Goemans, É Tardos, DP Williamson (2009)
Approximating the smallest k-edge connected spanning subgraph by LP-roundingNetworks, 53
-
K Jain (2001)
A factor 2 approximation algorithm for the generalized steiner network problemCombinatorica, 21
-
L Zhao, H Nagamochi, T Ibaraki (2003)
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problemInf. Process. Lett., 86
-
C Wang, M-A Park, J Willson, Y Cheng, A Farago, W Weili (2008)
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivityTheoret. Comput. Sci., 396
-
G Călinescu (2014)
1.61-approximation for min-power strong connectivity with two power levelsJ. Comb. Optim., 31
-
S Khuller, B Raghavachari, N Young (1995)
Approximating the minimum equivalent digraphSIAM J. Comput., 24
-
A Gupta, J Koenemann (2011)
Approximation algorithms for network design: A surveySurv Oper Res Manag Sci, 16
-
S Vempala, A Vetta (2000)
Approximation Algorithms for Combinatorial Optimization -
(2003)
On Steiner trees and minimum spanning trees in hypergraphsOper. Res. Lett., 31
-
S Khuller, B Raghavachari, N Young (1996)
On strongly connected digraphs with bounded cycle lengthDiscret. Appl. Math., 69
- Publisher
- Springer Journals
- Copyright
- Copyright © 2017 by Springer Science+Business Media, LLC
- Subject
- Computer Science; Algorithm Analysis and Problem Complexity; Theory of Computation; Mathematics of Computing; Algorithms; Computer Systems Organization and Communication Networks; Data Structures, Cryptology and Information Theory
- ISSN
- 0178-4617
- eISSN
- 1432-0541
- DOI
- 10.1007/s00453-017-0356-7
- Publisher site
- See Article on Publisher Site
Abstract
We consider a variety of NP-Complete network connectivity problems. We introduce a novel dual-based approach to approximating network design problems with cut-based linear programming relaxations. This approach gives a 3/2-approximation to Minimum 2-Edge-Connected Spanning Subgraph that is equivalent to a previously proposed algorithm. One well-studied branch of network design models ad hoc networks where each node can either operate at high or low power. If we allow unidirectional links, we can formalize this into the problem Dual Power Assignment (DPA). Our dual-based approach gives a 3 / 2-approximation to DPA, improving the previous best approximation known of $$11/7\approx 1.57$$ 11 / 7 ≈ 1.57 . Another standard network design problem is Minimum Strongly Connected Spanning Subgraph (MSCS). We propose a new problem generalizing MSCS and DPA called Star Strong Connectivity (SSC). Then we show that our dual-based approach achieves a 1.6-approximation ratio on SSC. As a consequence of our dual-based approximations, we prove new upper bounds on the integrality gaps of these problems.
Journal
Algorithmica – Springer Journals
Published: Aug 7, 2017