CIAC
2006
Springer
13 years 8 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...
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
CIAC
2006
Springer
13 years 8 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...
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...