255
click to vote
CIAC
15 years 11 months ago
2006 Springer
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...
179
click to vote
CIAC
15 years 11 months ago
2006 Springer
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...
225
click to vote
CIAC
15 years 11 months ago
2006 Springer
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...
182
Voted
CIAC
15 years 11 months ago
2006 Springer |