An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem

DOI10.1145/3519935.3520062arXiv2101.05921OpenAlexW3122114375MaRDI QIDQ6083616

Xinzhi Zhang, Anna R. Karlin, Shayan Oveis Gharan, Nathan Klein

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.05921

zbMATH Keywords

network designapproximation algorithmsrandomized roundingedge connectivitystrongly Rayleighmax entropy

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem