108
click to vote
CIAC
15 years 21 days 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...
68
Voted
CIAC
15 years 21 days 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...
CIAC
15 years 21 days 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...
CIAC
15 years 21 days ago
2006 Springer CIAC
15 years 21 days ago
2006 Springer |