An approximation algorithm for cutting out convex polygons

被引：0
|
作者：
Dumitrescu, A [1 ]
机构：
[1] Univ Wisconsin, Dept Comp Sci, Milwaukee, WI 53211 USA
来源：
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2003年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We provide an O(log n)-approximation algorithm for the following problem. Given a convex n-gon P, drawn on a convex piece of paper, cut P out of the piece of paper in the cheapest possible way. No approximation algorithm was known for this problem posed in 1985.
引用
收藏
页码：823 / 827
页数：5
相关论文
共 50 条
12345