Degree-constrained node-connectivity

Zeev Nutov

doi:10.1007/978-3-642-29344-3_49

Degree-constrained node-connectivity

Zeev Nutov

Computer Science discipline

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	LATIN 2012
Subtitle of host publication	Theoretical Informatics - 10th Latin American Symposium, Proceedings
Pages	582-593
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-29344-3_49
State	Published - 2012
Event	10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 - Arequipa, Peru Duration: 16 Apr 2012 → 20 Apr 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7256 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th Latin American Symposiumon Theoretical Informatics, LATIN 2012
Country/Territory	Peru
City	Arequipa
Period	16/04/12 → 20/04/12

Access to Document

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

Cite this

@inproceedings{57cf0a8f499242e7bb347ba2001b56ff,

title = "Degree-constrained node-connectivity",

abstract = "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.",

author = "Zeev Nutov",

year = "2012",

doi = "10.1007/978-3-642-29344-3_49",

language = "אנגלית",

isbn = "9783642293436",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "582--593",

booktitle = "LATIN 2012",

}

Nutov, Z 2012, Degree-constrained node-connectivity. in LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7256 LNCS, pp. 582-593, 10th Latin American Symposiumon Theoretical Informatics, LATIN 2012, Arequipa, Peru, 16/04/12. https://doi.org/10.1007/978-3-642-29344-3_49

Degree-constrained node-connectivity. / Nutov, Zeev.
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Proceedings. 2012. p. 582-593 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7256 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Degree-constrained node-connectivity

AU - Nutov, Zeev

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 -

Degree-constrained node-connectivity

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this