An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
Information Processing Letters
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Landscape analysis for multicast routing
Computer Communications
A factoring approach for the Steiner tree problem in undirected networks
Information Sciences: an International Journal
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Computers and Operations Research
Relay sensor placement in wireless sensor networks
Wireless Networks
Approximating minimum-power edge-covers and 2,3-connectivity
Discrete Applied Mathematics
Wireless network design via 3-decompositions
Information Processing Letters
On the full and bottleneck full Steiner tree problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximating minimum-power degree and connectivity problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Iterative node deployment in an unknown environment
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
Bounding the payment of approximate truthful mechanisms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Matroids and integrality gaps for hypergraphic steiner tree relaxations
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Research paper: The saga of minimum spanning trees
Computer Science Review
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
Hi-index | 0.00 |