ISAAC
2000
Springer
13 years 7 months ago
2000
Springer
ISAAC
2000
Springer
13 years 7 months ago
2000
Springer
ISAAC
2000
Springer
13 years 7 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
ISAAC
2000
Springer
13 years 7 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
ISAAC
2000
Springer
13 years 7 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
ISAAC
2000
Springer
13 years 7 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...