@InProceedings{bansal_et_al:LIPIcs.ICALP.2023.15,
author = {Bansal, Ishan and Cheriyan, Joseph and Grout, Logan and Ibrahimpur, Sharat},
title = {{Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.15},
URN = {urn:nbn:de:0030-drops-180678},
doi = {10.4230/LIPIcs.ICALP.2023.15},
annote = {Keywords: Approximation algorithms, Edge-connectivity of graphs, f-Connectivity problem, Flexible Graph Connectivity, Minimum cuts, Network design, Primal-dual method, Small cuts}
}