Foto Afrati, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko  Home/Search
Context Related
| softlab.ntua.gr/facilities/...FOCS99.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: softlab.ntua.gr/faci...postscript (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: (Update)
Similar documents based on text: More All
3.3: Approximation Schemes for Minimizing Average.. - Afrati, Bampis.. (1999) (Correct)
0.9: A PTAS for Minimizing Weighted Completion Time on Uniformly.. - Chekuri, al. (2001) (Correct)
0.7: Scheduling to Minimize the Average Completion Time .. - Afrati, Bampis.. (2000) (Correct)
Related documents from co-citation: More All
28: Scheduling to minimize average completion time: offline and on-line algorithms - Hall, Schulz et al. - 1996
16: Various Optimizers for Single-Stage Production (context) - Smith - 1956
14: Optimization and approximation in deterministic sequencing and scheduling: A sur.. (context) - Graham - 1979
BibTeX entry: (Update)
F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, to appear. http://citeseer.ist.psu.edu/afrati99approximation.html More
@inproceedings{ afrati99approximation,
author = "Foto N. Afrati and Evripidis Bampis and Chandra Chekuri and David R. Karger and Claire Kenyon and Sanjeev Khanna and Ioannis Milis and Maurice Queyranne and M. Sartinutella and Clifford Stein and Maxim Sviridenko",
title = "Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "32-44",
year = "1999",
url = "citeseer.ist.psu.edu/afrati99approximation.html" }
Citations (may not include all citations):212 Optimization and approximation in deterministic sequencing a.. (context) - Graham, Lawler et al. - 1979
204 Sequencing and scheduling: algorithms and complexity (context) - Lawler, Lenstra et al. - 1993
171 Scheduling to minimize average completion time: Offline and .. - Hall, Schulz et al. - 1997
152 Introduction to Sequencing and Scheduling (context) - Baker - 1974
104 Various optimizers for single-stage production (context) - Smith - 1956
95 Complexity of machine scheduling problems (context) - Lenstra, Kan et al. - 1977
77 An approximation algorithm for the generalized assignment pr.. (context) - Shmoys, Tardos - 1993
54 Approximation techniques for average completion time schedul.. - Chekuri, Motwani et al. - 1997
53 Scheduling with deadlines and loss functions (context) - McNaughton - 1959
46 Improved approximation algorithms for scheduling with releas.. (context) - Goemans - 1997
43 Scheduling independent tasks to reduce mean finishing time (context) - Bruno, Coffman et al. - 1974
43 Improved scheduling algorithms for minsum criteria - Chakrabarti, Phillips et al. - 1996
35 Exact and approximate algorithms for scheduling nonidentical.. (context) - Horowitz, Sahni - 1976
31 Minimizing average completion time in the presence of releas.. - Phillips, Stein et al. - 1998
22 Scheduling LPs bear probabilities: Randomized approximations.. - Schulz, Skutella - 1997
20 Single machine scheduling with release dates - Goemans, Queyranne et al. - 1999
18 Nonapproximability results for scheduling problems with mins.. - Hoogeveen, Schuurman et al. - 1998
15 Approximation schemes for scheduling on parallel machines (context) - Alon, Azar et al. - 1998
14 Minimizing average flow time with parallel machines (context) - Horn - 1973
13 Approximation bounds for a general class of precedence const.. - Munier, Queyranne et al. - 1998
11 approximation algorithm for a preemptive single-machine sche.. - Goemans, Wein et al. - 1997
11 Semidefinite relaxations for parallel machine scheduling - Skutella - 1998
11 Precedence constrained scheduling to minimize weighted compl.. - Chekuri, Motwani - 1999
9 The Power of alpha-Points in Preemptive Single Machine Sched.. - Schulz, Skutella - 1999
9 A PTAS for minimizing the weighted sum of job completion tim.. - Skutella, Woeginger - 1999
7 Convex quadratic programming relaxations for network schedul.. - Skutella - 1999
6 the relationship between combinatorial and lp-based approach.. - Uma, Wein - 1999
5 Lower bounds for srptsubsequence algorithms for nonpreemptiv.. - Torng, Uthaisombut - 1999
3 An experimental study of LP-based scheduling heuristics (context) - Savelsbergh, Uma et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.softlab.ntua.gr/facilities/public/AD/foto/postscript.html): More
Inheritance in Object Oriented Datalog: A Modular Logic.. - Afrati, Karali, Mitakos (1997) (Correct)
Chain Queries Expressible by Linear Datalog Programs - Afrati (1997) (Correct)
Arity Hierarchies for Fixed-Point Logics - Foto Afrati National (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