Sciweavers

ALGORITHMICA
2005
92views more  ALGORITHMICA 2005»
13 years 4 months ago
Average-Case Competitive Analyses for Ski-Rental Problems
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after r...
Hiroshi Fujiwara, Kazuo Iwama
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 4 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 4 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
ALGORITHMICA
2005
80views more  ALGORITHMICA 2005»
13 years 4 months ago
Building Edge-Failure Resilient Networks
Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph ...
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 4 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 4 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
ALGORITHMICA
2005
97views more  ALGORITHMICA 2005»
13 years 4 months ago
Representing Trees of Higher Degree
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
David Benoit, Erik D. Demaine, J. Ian Munro, Rajee...
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 4 months ago
Biased Skip Lists
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 i n, the time to access item i is O...
Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goo...
ALGORITHMICA
2005
95views more  ALGORITHMICA 2005»
13 years 4 months ago
Near-Linear Time Approximation Algorithms for Curve Simplification
Abstract. We consider the problem of approximating a polygonal curve
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...