An improved randomized on-line algorithm for a weighted interval selection problem

Journal of Scheduling

Volumn 7, Issue 4, 2004, Pages 293-311

  Miyazawa, Hiroyuki ^a   Erlebach, Thomas ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b ETH ZURICH   (Switzerland)

Author keywords

Competitive analysis; Interval scheduling; Lower bound; On line algorithm; Randomized algorithm; Upper bound

Indexed keywords

ALGORITHMS; CALIBRATION; DECISION MAKING; MATHEMATICAL MODELS; PROBLEM SOLVING; RISK ASSESSMENT; ROBUSTNESS (CONTROL SYSTEMS);

COMPETITIVE ANALYSIS; INTERVAL SCHEDULING; LOWER BOUND; ON-LINE ALGORITHM; RANDOMIZED ALGORITHMS; UPPER BOUND;

SCHEDULING;

EID: 3042829826     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOSH.0000031423.39762.d3     Document Type: Article

References (16)

1. Fiat, A and G. J. Woeginger, (ed.), Online Algorithms: The State of the Art, LNCS 1442, Springer-Verlag, 1998.
2. Bogart, K. P. and D. B. West, "A short proof that 'Proper = Unit", Discrete Math. 201; 21-23 (1999).
3. Woeginger G. J. "On-line scheduling of jobs with fixed start and end times", Theor. Comput. Sci. 130; 5-16 (1994).
4. Canetti, R. and S. Irani, "Bounding the power of preemption in randomized scheduling", SIAM J. Comput. 27(4); 993-1015 (1998).
5. Goldman, S. A. J. Parwatikar and S. Suri. Online scheduling with hard deadlines, J. Algorighms, 34(2), 370-389 (2000).
6. Goldwasser, M. H. Patience is a virtue: The effect of slack on competitiveness for admission control. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '99, p. 396-405 (1999).
7. Baruah, S. G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, "On the competitiveness of on-line real-time task scheduling," Real-Time Sys., 4, 125-144 (1992).
8. Baruah, S. J. Haritsa, and N. Sharma, "On-line Scheduling to maximize task completions," J. Combinatorial Math. Combinatorial Comput. 39, 65-78 (2001).
9. Kalyanasundaram, B. and K. Pruhs, "Maximizing job completions online," in Proceedings of the Sixth Annual European Symposium on Algorithms ESA '98, LNCS 1461, Springer-Verlag, Berlin, 1998 p. 235-246.
10. Koren, G. and D. Shasha, "MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling," Theor. Comput. Sci. 128; 75-97 (1994).
11. Erlebach, T. and F.C.R. Spieksma, "Simple algorithms for a weighted interval selection problem," in Proceedings of the 11th Annual International Symposium on Algorithms and Computation ISAAC'00, LNCS 1969, p. 228-240 (2000).
12. Hsiao, J.Y. C.Y. Tang, and R.S. Chang, "An efficient algorithm for finding a maximum weight 2-independent set on interval graphs," Information Process. Lett. 43(5); 229-235 (1992).
13. Spieksma, F.C.R. "On the approximability of an interval scheduling problem," J. Sched., 2; 215-227 (1999).
14. Chuzhoy, J. R. Ostrovsky, and Y. Rabani, "Approximation algorithms for the job interval selection problem and related scheduling problems," in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science FOCS'01, p. 348-356 (2001).
15. Yao, A.C. "Probablistic computations: Towards a unified measure of complexity", in Proceedings of the 12th ACM Symposium on Theory of Computing STOC'77, p. 222-227 (1977).
16. Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge 1998.