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
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Blocking small cuts in a network, and related problems
SIAM Journal on Computing
Survivable networks, linear programming relaxations and the parsimonious property
Mathematical Programming: Series A and B
A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the design of approximation algorithms for a class of graph problems
On the design of approximation algorithms for a class of graph problems
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
SIAM Journal on Discrete Mathematics
A scaling technique for better network design
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
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
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Directed network design with orientation constraints
SODA '00 Proceedings of the eleventh 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
Approximation algorithms for minimum-cost k-vertex connected subgraphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
Approximating minimum size {1,2}-connected networks
Discrete Applied Mathematics
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics
A New Bound for the 2-Edge Connected Subgraph Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for a Directed Network Design Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Edge Covers of Setpairs and the Iterative Rounding Method
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Minimum Size 2-Connectivity Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
An approximation algorithm for the fault tolerant metric facility location problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Proceedings of the 10th annual international conference on Mobile computing and networking
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An almost O(log k)-approximation for k-connected subgraphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating minimum-power edge-covers and 2,3-connectivity
Discrete Applied Mathematics
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
A note on Rooted Survivable Networks
Information Processing Letters
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An improved approximation algorithm for minimum-cost subset k-connectivity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
An O(log n)-competitive algorithm for online constrained forest problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Designing hypergraph layouts to GMPLS routing strategies
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
The parsimonious property of cut covering problems and its applications
Operations Research Letters
Operations Research Letters
Node-weighted network design in planar and minor-closed families of graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating minimum-cost connectivity problems via uncrossable bifamilies
ACM Transactions on Algorithms (TALG)
Steiner forest orientation problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Fractional routing using pairs of failure-disjoint paths
Discrete Applied Mathematics
| Hi-index | 0.01 |