Sciweavers

Share
ISAAC
2000
Springer
95views Algorithms» more  ISAAC 2000»
8 years 11 months ago
Finding a Two-Core of a Tree in Linear Time
Biing-Feng Wang, Jyh-Jye Lin
ISAAC
2000
Springer
113views Algorithms» more  ISAAC 2000»
8 years 11 months ago
A New Competitive Analysis of Randomized Caching
Ching Law, Charles E. Leiserson
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
8 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
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...
Thomas Erlebach, Frits C. R. Spieksma
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
8 years 11 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
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...
Jianer Chen, Iyad A. Kanj
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
8 years 11 months ago
Online Routing in Convex Subdivisions
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...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
ISAAC
2000
Springer
100views Algorithms» more  ISAAC 2000»
8 years 11 months ago
An Improved Algorithm for Subdivision Traversal without Extra Storage
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...
Prosenjit Bose, Pat Morin
books