A.Z. Zelikovsky, A fast approximation algorithm for the Steiner tree problem in graphs, Inf. Process. Lett. 46 (1993) 79-83. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Steiner Tree Problems - Du, Lu, Ngo, Pardalos (2000) (1 citation) (Correct)
No context found.
A.Z. Zelikovsky, A fast approximation algorithm for the Steiner tree problem in graphs, Inf. Process. Lett. 46 (1993) 79-83.
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