Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On shredders and vertex connectivity augmentation
Journal of Discrete Algorithms
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
Extensions and limits to vertex sparsification
Proceedings of the forty-second ACM symposium on Theory of computing
Degree Bounded Network Design with Metric Costs
SIAM Journal on Computing
k-edge connected polyhedra on series-parallel graphs
Operations Research Letters
Hi-index | 0.00 |