A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Theoretical Computer Science
Performance evaluation for energy efficient topologic control in ad hoc wireless networks
Theoretical Computer Science
On the partial terminal Steiner tree problem
The Journal of Supercomputing
Note: Approximating the selected-internal Steiner tree
Theoretical Computer Science
(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Relay Nodes in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
On the full and bottleneck full Steiner tree problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
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
Near Optimal Bounds for Steiner Trees in the Hypercube
SIAM Journal on Computing
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
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
On the low-dimensional Steiner minimum tree problem in Hamming metric
Theoretical Computer Science
| Hi-index | 0.01 |
We investigate two methods for proving lower bounds on the size of small-depth circuits, namely the approaches based on multiparty communication games and algebraic characterizations extending the concepts of the tensor rank and rigidity of matrices. ...