When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
RNC-Approximation Algorithms for the Steiner Problem
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
Efficient Steiner tree construction based on spanning graphs
Proceedings of the 2003 international symposium on Physical design
Primal-dual schema based approximation algorithms
Theoretical aspects of computer science
Improved approximations for tour and tree covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Primal-Dual Schema Based Approximation Algorithms
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
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
On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic
Information Processing Letters
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
Approaches to the Steiner Problem in Networks
Algorithmics of Large and Complex Networks
New geometry-inspired relaxations and algorithms for the metric steiner tree problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Heuristic algorithms for minimum bandwith consumption multicast routing in wireless mesh networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Hypergraphic LP relaxations for steiner trees
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Matroids and integrality gaps for hypergraphic steiner tree relaxations
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
| Hi-index | 0.00 |