T. Chan. Euclidean bounded-degree spanning tree ratios. In Proc. 19th ACM Symp. of Computational Geometry (SOCG), pages 11--19, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximation Algorithms for the Single-Sink Edge Installation.. - Jothi (2004) (Correct)
No context found.
T. Chan. Euclidean bounded-degree spanning tree ratios. In Proc. 19th ACM Symp. of Computational Geometry (SOCG), pages 11--19, 2003.
Degree-Bounded Minimum Spanning Trees - Jothi, Raghavachari (2004) (Correct)
No context found.
T. Chan, Euclidean bounded-degree spanning tree ratios, SoCG 2003.
Degree-Bounded Minimum Spanning Trees - Raja Jothi Balaji (2004) (Correct)
No context found.
T. Chan, Euclidean bounded-degree spanning tree ratios, Proc. of the 19th ACM Symp. of Computational Geometry, 2003.
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