Author:
Deng Ping,Wu Weili,Shragowitz Eugene,Du Ding-Zhu
Reference15 articles.
1. Arora S (1996) Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 37th IEEE symposium on foundations of computer science, pp 2–12
2. Arora S (1997) Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 38th IEEE symposium on foundations of computer science, pp 554–563
3. Arora S (1998) Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J ACM 45:753–782
4. Du D-Z, Pan, L-Q, Shing, M-T (1986) Minimum edge length guillotine rectangular partition. Technical report 0241886, Math. Sci. Res. Inst., Univ. California, Berkeley
5. Du D-Z, Hsu DF, Xu K-J (1987) Bounds on guillotine ratio. Congressus Numerantium 58:313–318