Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
Biconnectivity approximations and graph carvings
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved approximations for the Steiner tree problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Survivable networks, linear programming relaxations and the parsimonious property
Mathematical Programming: Series A and B
When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for minimum-cost vertex-connectivity problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A scaling technique for better network design
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating minimum size {1,2}-connected networks
Discrete Applied Mathematics
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximation Algorithms for a Network Design Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Approximating minimum-cost graph problems with spanning tree edges
Operations Research Letters
The parsimonious property of cut covering problems and its applications
Operations Research Letters
| Hi-index | 0.01 |