Sciweavers

CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 5 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 5 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
15 years 5 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
CIAC
2006
Springer
125views Algorithms» more  CIAC 2006»
15 years 5 months ago
On the Minimum Common Integer Partition Problem
Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
Algorithms
Top of PageReset Settings