A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Guy Even; Guy Kortsarz; Zeev Nutov

doi:10.1016/j.ipl.2010.12.010

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

Guy Even, Guy Kortsarz, Zeev Nutov

מדעי המחשב

פרסום מחקרי: פרסום בכתב עת › מאמר › ביקורת עמיתים

תקציר

We consider the following NP-hard problem: given a connected graph G=(V,ε) and a link set E on V disjoint to ε, find a minimum size subset of edges F ⊆ E such that (V,ε∪F) is 2-edge-connected. In G. Even et al. (2005) [2] we presented a 1.8-approximation for the problem. In this paper we improve the ratio to 1.5.

שפה מקורית	אנגלית
עמודים (מ-עד)	296-300
מספר עמודים	5
כתב עת	Information Processing Letters
כרך	111
מספר גיליון	6
מזהי עצם דיגיטלי (DOIs)	https://doi.org/10.1016/j.ipl.2010.12.010
סטטוס פרסום	פורסם - 15 פבר׳ 2011

הערה ביבליוגרפית

Funding Information:
✩ Preliminary version in APPROX 2001, pp. 90–101. * Corresponding author. E-mail addresses: [email protected] (G. Even), [email protected] (G. Kortsarz), [email protected] (Z. Nutov). 1 Partially supported by NSF grant number 0728787.

גישה למסמך

10.1016/j.ipl.2010.12.010

קבצים וקישורים אחרים

Link to publication in Scopus

פורמט ציטוט ביבליוגרפי

@article{1445c0368b204cf7ac21b3f5e1263fbf,

title = "A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2",

abstract = "We consider the following NP-hard problem: given a connected graph G=(V,ε) and a link set E on V disjoint to ε, find a minimum size subset of edges F ⊆ E such that (V,ε∪F) is 2-edge-connected. In G. Even et al. (2005) [2] we presented a 1.8-approximation for the problem. In this paper we improve the ratio to 1.5.",

keywords = "Approximation algorithms, Laminar family, Tree augmentation",

author = "Guy Even and Guy Kortsarz and Zeev Nutov",

note = "Funding Information: ✩ Preliminary version in APPROX 2001, pp. 90–101. * Corresponding author. E-mail addresses: [email protected] (G. Even), [email protected] (G. Kortsarz), [email protected] (Z. Nutov). 1 Partially supported by NSF grant number 0728787.",

year = "2011",

month = feb,

day = "15",

doi = "10.1016/j.ipl.2010.12.010",

language = "אנגלית",

volume = "111",

pages = "296--300",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

AU - Even, Guy

AU - Kortsarz, Guy

AU - Nutov, Zeev

N1 - Funding Information: ✩ Preliminary version in APPROX 2001, pp. 90–101. * Corresponding author. E-mail addresses: [email protected] (G. Even), [email protected] (G. Kortsarz), [email protected] (Z. Nutov). 1 Partially supported by NSF grant number 0728787.

PY - 2011/2/15

Y1 - 2011/2/15

N2 - We consider the following NP-hard problem: given a connected graph G=(V,ε) and a link set E on V disjoint to ε, find a minimum size subset of edges F ⊆ E such that (V,ε∪F) is 2-edge-connected. In G. Even et al. (2005) [2] we presented a 1.8-approximation for the problem. In this paper we improve the ratio to 1.5.

AB - We consider the following NP-hard problem: given a connected graph G=(V,ε) and a link set E on V disjoint to ε, find a minimum size subset of edges F ⊆ E such that (V,ε∪F) is 2-edge-connected. In G. Even et al. (2005) [2] we presented a 1.8-approximation for the problem. In this paper we improve the ratio to 1.5.

KW - Approximation algorithms

KW - Laminar family

KW - Tree augmentation

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

U2 - 10.1016/j.ipl.2010.12.010

DO - 10.1016/j.ipl.2010.12.010

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:78650268807

SN - 0020-0190

VL - 111

SP - 296

EP - 300

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

תקציר

הערה ביבליוגרפית

גישה למסמך

קבצים וקישורים אחרים

טביעת אצבע

פורמט ציטוט ביבליוגרפי