Degree-constrained node-connectivity

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationLATIN 2012
Subtitle of host publicationTheoretical Informatics - 10th Latin American Symposium, Proceedings
Number of pages12
StatePublished - 2012
Event10th Latin American Symposiumon Theoretical Informatics, LATIN 2012 - Arequipa, Peru
Duration: 16 Apr 201220 Apr 2012

Publication series

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


Conference10th Latin American Symposiumon Theoretical Informatics, LATIN 2012


Dive into the research topics of 'Degree-constrained node-connectivity'. Together they form a unique fingerprint.

Cite this