TY - GEN

T1 - A 4 + ε approximation for k-connected subgraphs

AU - Nutov, Zeev

N1 - Publisher Copyright:
Copyright © 2020 by SIAM
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2020

Y1 - 2020

N2 - We obtain approximation ratio (equation presented) for the (undirected) k-Connected Subgraph problem, where l = (equation presented) is the largest integer such that 2l−1k2l+1 ≤ n. For large values of n this improves the ratio 6 of Cheriyan and Végh [4] when n ≥ k3 (the case l = 1). Our result implies an fpt-approximation ratio 4 + ε that matches (up to the “+ε” term) the best known ratio 4 for k = 6, 7 for both the general and the easier augmentation versions of the problem. Similar results are shown for the problem of covering an arbitrary crossing supermodular biset function.

AB - We obtain approximation ratio (equation presented) for the (undirected) k-Connected Subgraph problem, where l = (equation presented) is the largest integer such that 2l−1k2l+1 ≤ n. For large values of n this improves the ratio 6 of Cheriyan and Végh [4] when n ≥ k3 (the case l = 1). Our result implies an fpt-approximation ratio 4 + ε that matches (up to the “+ε” term) the best known ratio 4 for k = 6, 7 for both the general and the easier augmentation versions of the problem. Similar results are shown for the problem of covering an arbitrary crossing supermodular biset function.

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85084087823

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1000

EP - 1009

BT - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020

A2 - Chawla, Shuchi

PB - Association for Computing Machinery

T2 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020

Y2 - 5 January 2020 through 8 January 2020

ER -