SIAMCOMP
2008
13 years 10 months ago
2008
SIAMCOMP
2008
13 years 10 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
SIAMCOMP
2008
13 years 10 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
SIAMCOMP
2008
13 years 10 months ago
2008
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
SIAMCOMP
2008
13 years 10 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
SIAMCOMP
2008
13 years 10 months ago
2008
SIAMCOMP
2008
13 years 10 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
SIAMCOMP
2008
13 years 10 months ago
2008
SIAMCOMP
2008
13 years 10 months ago
2008
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...