Sciweavers

Share
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
9 years 11 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
SODA
2008
ACM
125views Algorithms» more  SODA 2008»
9 years 11 months ago
Ultra-low-dimensional embeddings for doubling metrics
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
9 years 11 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
9 years 11 months ago
Broadcast scheduling: algorithms and complexity
Jessica Chang, Thomas Erlebach, Renars Gailis, Sam...
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
9 years 11 months ago
A plant location guide for the unsure
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
9 years 11 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»
9 years 11 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»
9 years 11 months ago
Finding one tight cycle
Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan M...
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
9 years 11 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»
9 years 11 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
books