A note on the vertex-connectivity augmentation problem

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Using the polynomial algorithm given in [T. Jordán, On the optimal vertex-connectivity augmentation,J. Combin. Theory Ser. B63(1995), 8-20] ak-connected undirected graphG=(V,E) can be made (k+1)-connected by adding at mostk-2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a slightly modified version of) this algorithm differs from the optimum by at most ⌈(k-1)/2⌉.

Original languageEnglish
Pages (from-to)294-301
Number of pages8
JournalJournal of Combinatorial Theory. Series B
Volume71
Issue number2
DOIs
Publication statusPublished - Nov 1997

Fingerprint

Vertex Connectivity
Augmentation
Lower bound
Polynomial Algorithm
Polynomials

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A note on the vertex-connectivity augmentation problem. / Jordán, T.

In: Journal of Combinatorial Theory. Series B, Vol. 71, No. 2, 11.1997, p. 294-301.

Research output: Contribution to journalArticle

@article{0e6cb57346ac47f59223daa7f85dd7ef,
title = "A note on the vertex-connectivity augmentation problem",
abstract = "Using the polynomial algorithm given in [T. Jord{\'a}n, On the optimal vertex-connectivity augmentation,J. Combin. Theory Ser. B63(1995), 8-20] ak-connected undirected graphG=(V,E) can be made (k+1)-connected by adding at mostk-2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a slightly modified version of) this algorithm differs from the optimum by at most ⌈(k-1)/2⌉.",
author = "T. Jord{\'a}n",
year = "1997",
month = "11",
doi = "10.1006/jctb.1997.1786",
language = "English",
volume = "71",
pages = "294--301",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - A note on the vertex-connectivity augmentation problem

AU - Jordán, T.

PY - 1997/11

Y1 - 1997/11

N2 - Using the polynomial algorithm given in [T. Jordán, On the optimal vertex-connectivity augmentation,J. Combin. Theory Ser. B63(1995), 8-20] ak-connected undirected graphG=(V,E) can be made (k+1)-connected by adding at mostk-2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a slightly modified version of) this algorithm differs from the optimum by at most ⌈(k-1)/2⌉.

AB - Using the polynomial algorithm given in [T. Jordán, On the optimal vertex-connectivity augmentation,J. Combin. Theory Ser. B63(1995), 8-20] ak-connected undirected graphG=(V,E) can be made (k+1)-connected by adding at mostk-2 surplus edges over (a lower bound of) the optimum. Here we introduce two new lower bounds and show that in fact the size of the solution given by (a slightly modified version of) this algorithm differs from the optimum by at most ⌈(k-1)/2⌉.

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

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

U2 - 10.1006/jctb.1997.1786

DO - 10.1006/jctb.1997.1786

M3 - Article

VL - 71

SP - 294

EP - 301

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 2

ER -