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é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.
Original language | English |
---|---|
Title of host publication | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 |
Editors | Shuchi Chawla |
Publisher | Association for Computing Machinery |
Pages | 1000-1009 |
Number of pages | 10 |
ISBN (Electronic) | 9781611975994 |
State | Published - 2020 |
Event | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 - Salt Lake City, United States Duration: 5 Jan 2020 → 8 Jan 2020 |
Publication series
Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
Volume | 2020-January |
Conference
Conference | 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020 |
---|---|
Country/Territory | United States |
City | Salt Lake City |
Period | 5/01/20 → 8/01/20 |
Bibliographical note
Publisher Copyright:Copyright © 2020 by SIAM