Jittat Fakcharoenphol, Bundit Laekhanukit
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC, 2008.
@inproceedings{STOC-2008-FakcharoenpholL, author = "Jittat Fakcharoenphol and Bundit Laekhanukit", booktitle = "{Proceedings of the 40th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/1374376.1374401", isbn = "978-1-60558-047-0", pages = "153--158", publisher = "{ACM}", title = "{An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem}", year = 2008, }