N. Bansal K. Dhamdhere October 6, 2002  Home/Search
Context Related
| cmu.edu/~kedar/soda03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~kedar/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of minimizing weighted ow time on a single machine in the preemptive setting. Our main result is an O(log W ) competitive online algorithm where the maximum to the minimum ratio of weights is W . More generally our algorithm achieves a competitive ratio of k if there are k weight classes. This gives the rst O(1)- competitive algorithm for constant k. No O(1) competitive algorithm was known previously even for the special case of k = 2. These results settle a question... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
5: Theoretical Computer Science (context) - Motwani, Philips et al. - 1994
5: Load Balancing in the L p Norm - Awerbuch, Azar et al. - 1995
5: Online weighted flow time and deadline scheduling - Becchetti, Leonardi et al. - 2001
BibTeX entry: (Update)
N. Bansal and K. Dhamdhere. Minimizing weighted flow time. In Symposium on Discrete Algorithms SODA, pages 508--516, 2003. http://citeseer.ist.psu.edu/bansal03minimizing.html More
@misc{ bansal03minimizing,
author = "N. Bansal and K. Dhamdhere",
title = "Minimizing weighted flow time",
text = "N. Bansal and K. Dhamdhere. Minimizing weighted flow time. In Symposium
on Discrete Algorithms SODA, pages 508--516, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/bansal03minimizing.html" }
Citations (may not include all citations):171 Scheduling to minimize average completion time: Of- ine and .. - Hall, Schulz et al. - 1997
104 Various optimizers for single-stage production (context) - Smith
95 Complexity of machine scheduling problems (context) - Lenstra, Kan et al. - 1977
92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 2000
54 Approximation techniques for average completion time schedul.. - Chekuri, Motwani et al. - 1997
31 Approximation schemes for minimizing average weighted comple.. - Afrati, Bampis et al. - 1999
28 Speed is more powerful than clairvoyance (context) - Berman, Coulston - 1999
25 Theoretical Computer Science (context) - Motwani, Phillips et al. - 1994
9 A proof of the optimality of the shortest processing remaini.. (context) - Schrage - 1968
7 Approximation schemes for preemptive weighted ow time (context) - Chekuri, Khanna - 2002
6 Algorithms for weighted ow time (context) - Chekuri, Khanna et al. - 2001
5 Online weighted ow time and deadline scheduling (context) - Becchetti, Leonardi et al. - 2001
3 Randomized weighted caching with two page weights (context) - Irani - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~kedar/papers.html): More
Non-clairvoyant Scheduling for Minimizing - Mean Slowdown Bansal (Correct)
Scheduling for Flow-Time with Admission - Control Nikhil Bansal (Correct)
Approximation Algorithms for Low-Distortion Embeddings Into - Low-Dimensional Spaces Mihai (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC