Sciweavers

SIAMCOMP
2008
131views more  SIAMCOMP 2008»
13 years 11 months ago
Special Issue on Foundations of Computer Science
Irit Dinur, Éva Tardos
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
13 years 11 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
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...
Philip N. Klein
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 11 months ago
The Euclidean Orienteering Problem Revisited
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...
Ke Chen 0006, Sariel Har-Peled
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
13 years 11 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
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...
Nir Halman
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
13 years 11 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
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...
Fabrizio Grandoni, Jochen Könemann, Alessandr...
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 11 months ago
I/O-Efficient Planar Separators
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. ...
Anil Maheshwari, Norbert Zeh
SIAMCOMP
2008
63views more  SIAMCOMP 2008»
13 years 11 months ago
Uniform Hashing in Constant Time and Optimal Space
Anna Pagh, Rasmus Pagh
SIAMCOMP
2008
132views more  SIAMCOMP 2008»
13 years 11 months ago
An APTAS for Generalized Cost Variable-Sized Bin Packing
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...
Leah Epstein, Asaf Levin