Edge-packing of graphs and network reliability
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Finding Steiner forests in planar graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An approximation algorithm for minimum-cost vertex-connectivity problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-line generalized Steiner problem
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
Directed network design with orientation constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for a Directed Network Design Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Additive approximation for bounded degree survivable network design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ACM Transactions on Algorithms (TALG)
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Balanced allocation with succinct representation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the vehicle routing problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Policy-assisted planning and deployment of virtual networks
Proceedings of the 7th International Conference on Network and Services Management
Improved approximation algorithms for (budgeted) node-weighted steiner problems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |