Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

Published in The 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2022

Recommended citation: Chalermsook, Parinya, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, and Sorrachai Yingchareontharownchai. "Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver." In 49th International Colloquium on Automata, Languages, and Programming (ICALP), 2022. https://drops.dagstuhl.de/opus/volltexte/2022/16378/