Author:
Cheng Xiuzhen,Du Ding-Zhu,Kim Joon-Mo,Ruan Lu
Publisher
Kluwer Academic Publishers
Reference32 articles.
1. S. Arora, Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th IEEE Symp. on Foundations of Computer Science, (1996) pp. 2–12.
2. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, IProc. 38th IEEE Symp. on Foundations of Computer Science, (1997) pp. 554–563.
3. S. Arora, Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, Journal of the ACM 45 (1998) 753–782.
4. Mihaela Cadei, Xiaoyan Cheng, Xiuzhen Cheng, and Ding-Zhu Du, A tale in guillotine cut, in Proc. of Workshop on Novel Approaches to Hard Discrete Optimization, 2002
5. V.J. Dielissen and A. Kaldewaij, Rectangular partition is polynomial in two dimensions but NP-complete in three, Information Processing Letters 38 (1991) 1–6.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献