Improved Approximation for Two-Edge-Connectivity

Garg, Mohit; Grandoni, Fabrizio; Ameli, Afrouz Jabal

doi:10.1137/1.9781611977554.ch92

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction3

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem is NPhard, and it does not admit a PTAS unless P = NP [4]. The first result improving the factor 2 for 2-VCSS came from Khuller and Vishkin [9], which is a 5 3 -approximation algorithm. Garg, Vempala, and Singla [5] improved the approximation ratio to 3 2 .…”

Section: Introductionmentioning

confidence: 99%

“…The first result improving the factor 2 for 2-VCSS came from Khuller and Vishkin [9], which is a 5 3 -approximation algorithm. Garg, Vempala, and Singla [5] improved the approximation ratio to 3 2 . Cheriyan and Thurimella [1] also provides the same approximation ratio in a more general context, where they consider k-connectivity.…”

Section: Introductionmentioning

confidence: 99%

“…Vempala and Vetta [11] claimed the ratio 4 3 , which is shown to be not valid by Heeger and Vygen [7]. Jothi, Raghavachari and Varadarajan [8] claimed the ratio 5 4 . However, this claim has been later withdrawn (see [6]).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations