Sciweavers

Share
WINE
2005
Springer
131views Economy» more  WINE 2005»
9 years 9 months ago
On the Competitive Ratio of the Random Sampling Auction
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...
Uriel Feige, Abraham Flaxman, Jason D. Hartline, R...
ICTCS
2005
Springer
9 years 9 months ago
Laxity Helps in Broadcast Scheduling
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keun...
ICALP
2005
Springer
9 years 9 months ago
Dynamic Bin Packing of Unit Fractions Items
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
9 years 9 months ago
Online Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Leah Epstein
SPAA
2006
ACM
9 years 9 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
9 years 10 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
9 years 10 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
9 years 10 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
ESCAPE
2007
Springer
228views Algorithms» more  ESCAPE 2007»
9 years 10 months ago
Online Capacitated Interval Coloring
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
Leah Epstein, Thomas Erlebach, Asaf Levin
ESA
2007
Springer
131views Algorithms» more  ESA 2007»
9 years 10 months ago
Online Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de
Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, G...
books