Scheduling split intervals

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 732-741

  Bar Yehuda, Reuven ^a   Halldórsson, Magnús M ^b   Naor, Joseph ^a   Shachnai, Hadas ^c   Shapira, Irina ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b DECODE GENETICS   (Iceland)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS; SCHEDULING; SCHEDULING ALGORITHMS;

APPROXIMATION FACTOR; COMPUTATIONAL BIOLOGY; CONTINUOUS MEDIA DATA; LINEAR PROCESSOR ARRAYS; LOCAL RATIO TECHNIQUE; POLYNOMIAL TIME APPROXIMATION SCHEMES; RANDOMIZED ALGORITHMS; WEIGHT INDEPENDENT SETS;

APPROXIMATION ALGORITHMS;

EID: 77954646490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (46)

1. R. Adler, and Y. Azar. "Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Path and Call Control Algorithms''. In SODA '99, 1-10.
2. A. Aggarwal, J. Garay, and A. Herzberg. "Adaptive Video on Demand". In ESA '95, 538-553.
3. B. Awerbuch, Y. Azar, A. Fiat, and T. Leighton. "Making commitments in the face of uncertainty: how to pick a winner almost every time". In STOC '96, 519-530.
4. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen. "Competitive Non-Preemptive Call Control". In SODA '94, 312-320.
5. V. Bafna, B. Narayanan, andR, Ravi. "Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles)''. In Discrete Applied Mathematics, Vol. 71, Special issue on Computational Molecular Biology, 1996, pp. 41-53.
6. V. Bafna, P. Berman, and T. Fujito. "A 2-approximation Algorithm for the Undirected Feedback Vertex Set Problem, " SIAM J. on Disc. Mathematics, Vol. 12, pp. 289-297, 1999.
7. R. Bar-Yehuda and S. Even. "A Local Ratio Theorem for Approximating the Weighted Vertex Cover Problem, " Anna/5 of Discrete Mathematics, Vol. 25, pp. 27-46, 1985.
8. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. "A Unified Approach to Approximating Resource Allocation and Scheduling". In STOC '00, 735-744.
9. P. Basu, A. Narayanan, R. Krishnan, and T.D.C. Little. "An Implementation of Dynamic Service Aggregation for Interactive Video Delivery". In SPIE '98.
10. P. Berman. "A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs". Nordic Journal of Computing, Vol. 7, 2000, p. 178.
11. P. Berman, and T. Fujito. "Approximating Independent Sets in Degree 3 Graphs". In WADS '95, LNCS 955, 449-460.
12. P. Brucker, T. Hilbig, and J. Hurink. "A Branch and Bound Algorithm for a Single-Machine Scheduling problem with Positive and Negative Time-Lags". In Discrete Applied Mathematics, Vol. 94, 1999, pp. 77-99.
13. A. Dan, P. Shahabuddin, and D. Sitaram. "Channel Allocation Under Batching and VCR Control in Movie-On-Demand Servers", IBM Research Report RC19588, May 1994.
14. M. Dell'Amico. "Shop Problems with Two machines and Time Lags". In Operations Research, Vol. 44, No. 5, 1996, pp. 777-787.
15. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
16. F. Gavril. "Algorithms for Minimum Coloring, Maximum Clique, Minimum Coloring by Cliques, and Maximum Independent Set of a Chordal Graph". In SIAM J. Computing, Vol. 1, No. 2, 1972, pp. 180-187.
17. S. Goldman, J. Parwatikar, and S. Suri. "On-line Scheduling with Hard Deadlines''. In WADS '97, 258-271.
18. M. Goldwasser. "Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control". In SODA '99, 396-405.
19. M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.
20. J.R. Griggs, and D.B. West. "Extremal Values of the Interval Number of a Graph". In SIAM J. Algebraic and Discrete Methods, 1980, Vol. 1, No. 1, pp. 1-7.
21. A. Gyarfas. "On the chromatic number of multiple interval graphs and overlap graphs". In Discrete Math. 55 (1985), 161-166
22. A. Gyarfas and D. B. West. "Multitrack Interval Graphs". Congr. Numer. 109 (1995), 109-116.
23. L.A. Hall. "ApproximabUity of Flow Shop Scheduling". In Mathematical Programming, 1998, Vol. 82, pp. 175-190.
24. L.A.Hall, and D.B. Shmoys. "Approximation Algorithms for Constrained Scheduling Problems". In FOCS '89, 134-139.
25. M. M. Halldorsson, S. Rajagopalan, H. Shachnai, and A. Tomkins. "Scheduling Multiple Resources". Manuscript, 1999.
26. M. M. Hallddrsson, K. Yoshihara. "Approximation Algorithms for Maximum Independent Set Problem on Cubic Graphs", In ISAAC '95, LNCS 1004, 152-161.
27. C. A. J. Hurkens, and A. Schrijver. "On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems". SIAM J. Discrete Math., vol 2, 1989, pp. 68-72.
28. K. Jansen, R. Solis-Oba, and M. Sviridenko. "Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme". In STOC '99, 394-399.
29. D. Karger, C. Stein, and J. Wein. "Scheduling Algorithms". Algorithms and Theory of Computation Handbook, CRC Press, 1997.
30. A. V. Kostochka and D. B. West. "Every outerplanar graph is the union of two interval graphs". Gongr. Numer. 139 (1999), 5-8.
31. N. Kumar and N. Deo. "Multidimensional interval graphs". Gongr. Numer. 102 (1994), 45-56.
32. R. Lipton and A. Tomkins. "Online Interval Scheduling". In SODA '94, 302-311.
33. C. Martin, P. S. Narayanan, B. Ozden, R. Rastogi, and A. Silberschatz. "The Fellini Multimedia Storage Server". In Multimedia Information Storage and Management, Kluwer Academic Publishers, 1996.
34. A.J. Orman, and C.N. Potts. "On the Complexity of Coupled-Task Scheduling". In Discrete Applied Mathematics, Vol. 72, 1997, pp. 141-154.
35. C.H. Papadimitriou, and M. Yannakakis. "Optimization, approximation, and complexity classes". In J. Computer and System Sciences, 1991, Vol. 43, pp. 425-440.
36. A.H.G. Rinnooy Kan. Machine Scheduling Problems. Martinus Nijhoff, The Hague, 1976.
37. D. Rotem, and S. Seshadri. "Analysis of Disk Arm Movement for Retrieval of Large Objects". In PODS '92.
38. E.R. Scheinerman and D. B. West. "The interval number of a planar graph -three intervals suffice". J. Corn-bin. Theory (B) 35 (1983), 224-239.
39. J.P. Schmidt, A. Siegel, and A. Srinivasan. "Chernoff-Hoeffding Bounds for Applications with Limited Independence". In SIAM J. Discrete Math., Vol. 6, 1995, pp. 223-250.
40. R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, 1996.
41. R.D. Shapiro. "Scheduling Coupled Iaaks". In Naval Research Logistics Quarterly, Vol. 27, 1980, 489-498.
42. D.B. Shmoys, C. Stein, and J. Wein. "Improved Approximation Algorithms for Shop Scheduling Problems". In SIAM J. Computing, Vol. 23, 1994, pp. 617-632.
43. L. Trevisan. "Non-approximability results for optimization problems on bounded degree instances". In STOC '01, 453-461.
44. W.T. Trotter, Jr. and F. Harary. "On Double and Multiple Interval Graphs". In Journal of Graph Theory, Vol. 3, 1979, pp. 205-211.
45. D.B. West, and D.B. Shmoys. "Recognizing Graphs with Fixed Interval Number is NP-CompIete". In .Discrete Applied Mathematics, Vol. 8, 1984, pp. 295-305.
46. P.S. Yu, J.L. Wolf, and H. Shachnai. "Design and Analysis of a Look-ahead Scheduling Scheme to Support Pause-Resume Video-on-Demand Applications". In ACM Multimedia Systems Journal, Vol. 3, 1995, pp. 137-149.