The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
A polynomial-time approximation scheme for weighted planar graph TSP
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
RNC-Approximation Algorithms for the Steiner Problem
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects 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
Better approximation bounds for the network and Euclidean Steiner tree problems
Better approximation bounds for the network and Euclidean Steiner tree problems
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the terminal Steiner tree problem
Information Processing Letters
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximating Multicast Congestion
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
On the partial terminal Steiner tree problem
The Journal of Supercomputing
Automated antenna positioning algorithms for wireless fixed-access networks
Journal of Heuristics
Note: Approximating the selected-internal Steiner tree
Theoretical Computer Science
Approximating the Generalized Capacitated Tree-Routing Problem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A reliable and data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the full and bottleneck full Steiner tree problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
A scalable and dynamic data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Bounding the payment of approximate truthful mechanisms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Preplanned restoration of multicast demands in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |