@inproceedings{759b627bfb4c4ac390f93b875475492a,

title = "A 4 + ε approximation for k-connected subgraphs",

abstract = "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{\'e}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.",

author = "Zeev Nutov",

note = "Publisher Copyright: Copyright {\textcopyright} 2020 by SIAM; 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 ; Conference date: 05-01-2020 Through 08-01-2020",

year = "2020",

language = "الإنجليزيّة",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "1000--1009",

editor = "Shuchi Chawla",

booktitle = "31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020",

}