G. Robins and A. Zelikovsky. Improved Steiner Tree Approximation in Graphs. In Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 770-779, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Primal-Dual Algorithms for QoS Multimedia Multicast - Calinescu, Fernandes.. Self-citation (Zelikovsky) (Correct)
No context found.
G. Robins and A. Zelikovsky, Improved Steiner Tree Approximation in Graphs, Proc. of ACM/SIAM Symposium on Discrete Algorithms (SODA 2000), 770--779.
Power Efficient Range Assignment for Symmetric.. - Althaus.. Self-citation (Zelikovsky) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms, pages 770--779, 2000.
Line-of-Sight Networks - Alan Frieze Jon (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner Tree Approximation in Graphs. In Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 770-779, 2000.
Skeleton-Based Seam Computation for Triangulated Surface.. - Zhu, Hu, Martin (2003) (Correct)
No context found.
Robins, G. and Zelikovsky, A.: Improved Steiner tree approximation in graphs. Proceedings of the 11th annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, (2000) 770--779.
Approximation Schemes For Node-Weighted Geometric Steiner Tree .. - Remy, Steger (2005) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms, pages 770--779, 2000.
Approximation Schemes for Node-Weighted - Geometric Steiner Tree (2005) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms, pages 770--779, 2000.
A Faster Algorithm for the Steiner Tree Problem - Mölle, Richter, Rossmanith (2005) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pages 770--779,
On Rajagopalan and Vazirani's 3/2-Approximation Bound for the.. - Rizzi (Correct)
No context found.
G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs. SODA 2000.
Differential approximation results for the Steiner tree.. - Demange, Monnot, Paschos (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proc. Symposium on Discrete Algorithms, pages 770779, 2000.
Trade-offs on the Location of the Core Node in a Network - Macq, Goemans (2004) (Correct)
No context found.
G. Robins and A. Zelikovsky, "Improved Steiner tree approximation in graphs," Proc of ACM-SIAM Symp Discrete Algorithms (SODA
On Achieving Optimal Throughput with Network Coding - Li, Li, Jiang, Lau (Correct)
No context found.
G. Robins and A. Zelikovsky, "Improved Steiner Tree Approximation in Graphs," in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000.
Boosted Sampling: Approximation Algorithms for Stochastic .. - Gupta, Pal, Ravi, Sinha (2004) (1 citation) (Correct)
No context found.
Gabriel Robins and Alexander Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770--779, 2000.
Cost-Sharing Mechanisms for Network Design - Gupta, Srinivasan, Tardos (2004) (1 citation) (Correct)
No context found.
Gabriel Robins and Alexander Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 770-779.
Online Algorithms for Network Design - Meyerson (2003) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. Proceedings of the 10th ACM-SIAM SODA, 2000. 9
Primal-Dual Algorithms for Connected Facility - Location Problems Chaitanya (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 770-779, 2000.
Lower Bounds for the Relative Greedy Algorithm for.. - Hougardy, Kirchner (Correct)
No context found.
G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 770--779.
Polynomial Time Algorithms for Network Information Flow - Sanders, Egner, Tolhuizen (13 citations) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. In 11th ACM Symposium on Parallel Architectures and Algorithms, pages 770--779, 2000.
On Achieving Optimal End-to-End Throughput in Data.. - Li, Li, Jiang, Lau (2004) (Correct)
No context found.
G. Robins and A. Zelikovsky, "Improved Steiner Tree Approximation in Graphs," in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000.
On Approximation Algorithms - For The Terminal (Correct)
No context found.
G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000, pp. 770--779.
Approximation Hardness of the Steiner Tree Problem on Graphs - Chlebik, Chlebikova (2002) (1 citation) (Correct)
No context found.
Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000, 770-779.
Energy-Efficient Wireless Network Design - Caragiannis, Kaklamanis.. (2003) (1 citation) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner Tree Approximations in Graphs. In Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '00), pp. 770-779, 2000.
Approximation via Cost-Sharing: A Simple.. - Gupta, Kumar, Pal.. (2003) (1 citation) (Correct)
No context found.
Gabriel Robins and Alexander Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770--779, 2000.
An Approximation Algorithm for the Multicast Congestion.. - Jansen, Zhang (2002) (3 citations) (Correct)
No context found.
G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 770-779.
Improved Approximation Algorithms for the Single-Sink.. - Jothi, Raghavachari (2003) (Correct)
No context found.
G. Robins and A. Zelikovsky, \Improved Steiner tree approximation in graphs," in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 770-779, 2000.
Approximation Algorithms for the Single-Sink Edge Installation.. - Jothi (2004) (Correct)
No context found.
G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 770--779, 2000.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC