There are planar graphs almost as good as the complete graph
Journal of Computer and System Sciences
Beyond Steiner's problem: a VLSI oriented generalization
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A 2.5-factor approximation algorithm for the k-MST problem
Information Processing Letters
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
The polymatroid steiner problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |