TY - GEN

T1 - Degree-constrained node-connectivity

AU - Nutov, Zeev

N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.

PY - 2012

Y1 - 2012

N2 - We give a general framework to handle node-connectivity degree constrained problems. In particular, for the κ-Outconnected Subgraph problem, for both directed and undirected graphs, our algorithm computes in polynomial time a solution J of cost O(log κ) times the optimal, such that deg J (v) = O(2 κ ) • b(v) for all ν ∈ V. Similar result are obtained for the Element-Connectivity and the κ-Connected Subgraph problems. The latter is a significant improvement on the particular case of only degree-approximation and undirected graphs considered in [5]. In addition, for the edge-connectivity directed Degree-Constrained κ-Outconnected Subgraph problem, we slightly improve the best known approximation ratio, by a simple proof.

AB - We give a general framework to handle node-connectivity degree constrained problems. In particular, for the κ-Outconnected Subgraph problem, for both directed and undirected graphs, our algorithm computes in polynomial time a solution J of cost O(log κ) times the optimal, such that deg J (v) = O(2 κ ) • b(v) for all ν ∈ V. Similar result are obtained for the Element-Connectivity and the κ-Connected Subgraph problems. The latter is a significant improvement on the particular case of only degree-approximation and undirected graphs considered in [5]. In addition, for the edge-connectivity directed Degree-Constrained κ-Outconnected Subgraph problem, we slightly improve the best known approximation ratio, by a simple proof.

UR - http://www.scopus.com/inward/record.url?scp=84860816332&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-29344-3_49

DO - 10.1007/978-3-642-29344-3_49

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84860816332

SN - 9783642293436

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 582

EP - 593

BT - LATIN 2012

T2 - 10th Latin American Symposiumon Theoretical Informatics, LATIN 2012

Y2 - 16 April 2012 through 20 April 2012

ER -