The geometry of scheduling

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 407-414

  Bansal, Nikhil ^a   Pruhs, Kirk ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Pittsburgh   (United States)

Author keywords

Geometric set cover; Scheduling; Weighted flow time

Indexed keywords

APPROXIMATION ALGORITHMS; GEOMETRY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

ALGORITHMIC APPROACH; APPROXIMATION RATIOS; FLOW-TIME; GEOMETRIC INTERPRETATION; LINEAR PROGRAMMING FORMULATION; LOCAL RATIO TECHNIQUE; POLYNOMIAL-TIME ALGORITHMS; SET COVER;

SCHEDULING;

EID: 78751514142     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.46     Document Type: Conference Paper

References (24)

1. N. Bansal, N. Buchbinder, and J. Naor. Randomized competitive algorithms for generalized caching. In ACM Symposium on Theory of Computing, pages 235-244, 2008.
2. N. Bansal and K. Dhamdhere. Minimizing weighted flow time. ACM Transactions on Algorithms, 3(4), 2007.
3. N. Bansal, A. Gupta, and R. Krishnaswamy. Generalized min sum set cover. In ACM-SIAM Symposium on Discrete Algorithms, 2010.
4. N. Bansal and K. Pruhs. Server scheduling in the lp norm: a rising tide lifts all boat. In ACM Symposium on Theory of Computing, pages 242-250, 2003.
5. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. J. ACM, 48(5):1069-1090, 2001.
6. R. Bar-Yehuda and D. Rawitz. On the equivalence between the primal-dual schema and the local ratio technique. SIAM J. Discrete Math., 19(3):762-797, 2005.
7. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, and K. Pruhs. Online weighted flow time and deadline scheduling. Journal of Discrete Algorithms, 4(3):339-352, 2006.
8. M. A. Bender, S. Muthukrishnan, and R. Rajaraman. Approximation algorithms for average stretch scheduling. Journal of Scheduling, 7(3):195-222, 2004.
9. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite vc-dimension. Discrete & Computational Geometry, 14(4):463-479, 1995.
10. T. Carnes and D. B. Shmoys. Primal-dual schema for capacitated covering problems. In Conference on Integer Programming and Combinatorial Optimization, pages 288-302, 2008.
11. R. D. Carr, L. Fleischer, V. J. Leung, and C. A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In ACM-SIAM Symposium on Discrete Algorithms, pages 106-115, 2000.
12. D. Chakrabarty, E. Grant, and J. Konemann. On column restricted and priority integer covering programs. In Conference on Integer Programming and Combinatorial Optimization, 2010.
13. C. Chekuri, K. L. Clarkson, and S. Har-Peled. On the set multi-cover problem in geometric settings. In Symposium on Computational Geometry, pages 341-350, 2009.
14. C. Chekuri and S. Khanna. Approximation schemes for preemptive weighted flow time. In ACM Symposium on Theory of Computing, pages 297-305, 2002.
15. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time. In ACM Symposium on Theory of Computing, pages 84-93, 2001.
16. T. C. E. Cheng, C. T. Ng, J. J. Yuan, and Z. H. Liu. Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research, 165(2):423-443, 2005. (Pubitemid 40206373)
17. K. L. Clarkson and K. R. Varadarajan. Improved approximation algorithms for geometric set cover. Discrete & Computational Geometry, 37(1):43-58, 2007.
18. G. Karakostas, S. G. Kolliopoulos, and J. Wang. An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. In International Computing and Combinatorics Conference, pages 238-248, 2009.
19. E. L. Lawler. A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters, 1:207208, 1982.
20. R. Levi, A. Lodi, and M. Sviridenko. Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. Mathematics of Operations Research, 33(2), 2008.
21. J. Matousek. Lectures on Discrete Geometry. Springer, 2002.
22. K. Pruhs, J. Sgall, and E. Torng. Online scheduling. In Handbook on Scheduling. CRC Press, 2004.
23. K. R. Varadarajan. Epsilon nets and union complexity. In Symposium on Computational Geometry, pages 11-16, 2009.
24. K. R. Varadarajan. Weighted geometric set cover via quasiuniform sampling. In ACM Symposium on Theory of Computing, 2010.