Advertisement

Online Selection of Intervals and t-Intervals

  • Unnar Th. Bachmann
  • Magnús M. Halldórsson
  • Hadas Shachnai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)

Abstract

A t-interval is a union of at most t half-open intervals on the real line. An interval is the special case where t = 1. Requests for contiguous allocation of a linear resource can be modeled as a sequence of t-intervals. We consider the problems of online selection of intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among others. We derive lower bounds and (almost) matching upper bounds on the competitive ratios of randomized algorithms for selecting intervals, 2-intervals and t-intervals, for any t > 2. While offline t-interval selection has been studied before, the online version is considered here for the first time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: SODA, pp. 312–320 (1994)Google Scholar
  2. 2.
    Bachmann, U.T.: Online t-Interval Scheduling. MSc thesis, School of CS, Reykjavik Univ. (December 2009)Google Scholar
  3. 3.
    Bachmann, U.T., Halldórsson, M.M., Shachnai, H.: Online selection of intervals and t-intervals (2010), http://www.cs.technion.ac.il/~hadas/PUB/onint_full.pdf
  4. 4.
    Bar-Yehuda, R., Halldórsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling split intervals. In: SODA, pp. 732–741 (2002)Google Scholar
  5. 5.
    Bar-Yehuda, R., Rawitz, D.: Using fractional primal-dual to schedule split intervals with demands. Discrete Optimization 3(4), 275–287 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Butman, A., Hermelin, D., Lewenstein, M., Rawitz, D.: Optimization problems in multiple-interval graphs. In: SODA (2007)Google Scholar
  7. 7.
    Halldórsson, M.M., Iwama, K., Miyazaki, S., Taketomi, S.: Online independent sets. Theoretical Computer Science 289(2), 953–962 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Halldórsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theoretical Comput. Sci. 130, 163–174 (1994)zbMATHCrossRefGoogle Scholar
  9. 9.
    Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. In: Congr. Numer., vol. 33, pp. 143–153 (1981)Google Scholar
  10. 10.
    Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Reading (2005)Google Scholar
  11. 11.
    Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: A survey. Naval Research Logistics 54, 530–543 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Lipton, R.J., Tomkins, A.: Online interval scheduling. In: SODA, pp. 302–311 (1994)Google Scholar
  13. 13.
    Spieksma, F.: On the approximability of an interval scheduling problem. J. Sched. 2, 215–227 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theor. Comput. Sci. 130(1), 5–16 (1994)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Unnar Th. Bachmann
    • 1
  • Magnús M. Halldórsson
    • 1
  • Hadas Shachnai
    • 2
  1. 1.School of Computer ScienceReykjavik UniversityReykjavikIceland
  2. 2.Department of Computer ScienceThe TechnionHaifaIsrael

Personalised recommendations