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
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Applications of submodular functions
Surveys in combinatorics, 1993
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On the orientation of graphs and hypergraphs
Discrete Applied Mathematics - Submodularity
Steiner forest orientation problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |