Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai. Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. In Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France. Volume 229 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{ChalermsookHNSS22, title = {Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver}, author = {Parinya Chalermsook and Chien-Chung Huang and Danupon Nanongkai and Thatchaphol Saranurak and Pattara Sukprasert and Sorrachai Yingchareonthawornchai}, year = {2022}, doi = {10.4230/LIPIcs.ICALP.2022.37}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.37}, researchr = {https://researchr.org/publication/ChalermsookHNSS22}, cites = {0}, citedby = {0}, booktitle = {49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France}, editor = {Mikolaj Bojanczyk and Emanuela Merelli and David P. Woodruff}, volume = {229}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-235-8}, }