Sciweavers

SODA
2008
ACM
77views Algorithms» more  SODA 2008»
14 years 1 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 1 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
14 years 1 months ago
Finding one tight cycle
Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan M...
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
14 years 1 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
14 years 1 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
14 years 1 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
SODA
2008
ACM
66views Algorithms» more  SODA 2008»
14 years 1 months ago
Embedding metric spaces in their intrinsic dimension
Ittai Abraham, Yair Bartal, Ofer Neiman
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 1 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
14 years 1 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
14 years 1 months ago
Maximum overhang
Mike Paterson, Yuval Peres, Mikkel Thorup, Peter W...