Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference19 articles.
1. A. Aazami, J. Cheriyan and B. Laekhanukit: A bad example for the iterative rounding method for mincost k-connected spanning subgraphs, Discrete Optimization 10 (2013) 25–41.
2. J. Cheriyan and B. Laekhanukit: Approximation algorithms for minimum-cost k-(S,T) connected digraphs, manuscript, 2010.
3. J. Cheriyan and L. Végh: Approximating minimum-cost k-node connected sub-graphs via independence-free graphs, manuscript, 2013.
4. J. Cheriyan, S. Vempala and A. Vetta: An approximation algorithm for the minimum-cost k-vertex connected subgraph, SIAM J. Computing 4 (2003) 1050–1055.
5. J. Fackharoenphol and B. Laekhanukit: An O(log2 k)-approximation algorithm for the k-vertex connected subgraph problem, in: STOC, 153–158, 2008.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献