Improved randomized results for that interval selection problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5193 LNCS, Issue , 2008, Pages 381-392

  Epstein, Leah ^a   Levin, Asaf ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ARBITRARY COSTS; COMPETITIVE RATIO; DECREASING FUNCTIONS; INTERVAL SELECTION; NON NEGATIVES; ON-LINE ALGORITHMS; RANDOMIZED ALGORITHMS; UNIT INTERVALS;

ARTIFICIAL INTELLIGENCE;

EID: 57749183619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_32     Document Type: Conference Paper

References (11)

1. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
2. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing 27(4), 993-1015 (1998)
3. Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics 59(3), 225-235 (1995)
4. Faigle, U., Nawijn, W.M.: Note on scheduling intervals on-line. Discrete Applied Mathematics 58(1), 13-17 (1995)
5. Fung, S.P.Y., Poon, C.K., Zheng, F.: Online interval scheduling: randomized and multiprocessor cases. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 176-186. Springer, Heidelberg (2007)
6. Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: A survey. Naval Research Logistics 54(5), 530-543 (2007)
7. Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research 127(2), 331-342 (2007)
8. Miyazawa, H., Erlebach, T.: An improved randomized online algorithm for a weighted interval selection problem. Journal of Scheduling 7(4), 293-311 (2004)
9. Seiden, S.S.: Randomized online interval scheduling. Operetions Research Letters 22(4-5), 171-177 (1998)
10. Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130(1), 5-16 (1994)
11. Yao, A.C.C.: Probabilistic computations: towards a unified measure of complexity. In: Proc. of the 18th Symposium on Foundations of Computer Science (FOCS 1977), pp. 222-227 (1977)