Steiner trees with a terminal order

Proceedings - 15th International Conference on Computing, CIC 2006

Volumn , Issue , 2006, Pages 254-259

  Martinez, Fábio Viduani ^a   Soares, José ^b  

^a FEDERAL UNIVERSITY OF MATO GROSSO DO SUL   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; ARCHITECTURAL DESIGN; COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PORT TERMINALS;

DESIGN PROBLEMS; INTERNATIONAL CONFERENCES; MINIMUM COSTS; PERMUTATION (PERM); POLYNOMIAL TIME APPROXIMATION SCHEME (PTAS); POLYNOMIAL-TIME ALGORITHMS; REAL LINE; STEINER TREE PROBLEM (STP); STEINER TREES; TERMINAL VERTICES; TERMINALS (AIRPORT);

TREES (MATHEMATICS);

EID: 45149097168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIC.2006.69     Document Type: Conference Paper

References (11)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and hardness of approximation problems," in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS). Pittsburgh, Pennsylvania, USA: IEEE Computer Society Press, October 1992, pp. 14-23.
2. M. Bern and P. Plassmann, "The Steiner problem with edge lengths 1 and 2," Information Processing Letters, vol. 32, pp. 171-176, 1989.
3. G. Robins and A. Zelikovsky, "Improved Steiner tree approximation in graphs," in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, USA, January 2000, pp. 770-779.
4. C. L. Lu, C. Y. Tang, and R. C.-T. Lee, "The full Steiner tree problem," Theoretical Computer Science, vol. 306, pp. 55-67, 2003.
5. D. E. Drake and S. Hougardy, "On approximation algorithms for the terminal Steiner tree problem," Information Processing Letters, vol. 89, no. 1, pp. 15-18, 2004.
6. B. Fuchs, "A note on the terminal Steiner tree problem," Information Processing Letters, vol. 87, pp. 219-220, 2003.
7. G. Lin and G. Xue, "On the terminal Steiner tree problem," Information Processing Letters, vol. 84, pp. 103-107, 2002.
8. F. V. Martinez, J. C. de Pina, and J. Soares, "Approximations for terminal Steiner trees," in The 11th Annual International Computing and Combinatorics Conference (COCOON), ser. Lecture Notes in Computer Science, L. Wang, Ed., vol. 3595. Kunming, Yunnan, China: Springer, 2005, pp. 369-379.
9. C. Gröpl, S. Hougardy, T. Nierhoff, and H. J. Prömel, "Approximation algorithms for the Steiner tree problem in graphs," in Steiner Trees in Industries, D. Z. Du and X. Cheng, Eds. Dordrecht: Kluwer Academic Publishers, 2001, pp. 235-279.
10. A. Borchers and D.-Z. Du, "The k-Steiner ratio in graphs," SIAM Journal on Computing, vol. 26, pp. 857-869, 1997.
11. A. Zelikovsky, "An 11/6-approximation algorithm for the Steiner tree problem in graphs," Algorithmica, vol. 9, pp. 463-470, 1993.