Abstract
We investigate dynamic algorithms for the interval scheduling problem. We focus on the case when the set of intervals is monotonic. This is when no interval properly contains another interval. We provide two data structures for representing the intervals that allow efficient insertion, removal and various query operations. The first dynamic algorithm, based on the data structure called compatibility forest, runs in amortised time O(log2 n) for insertion and removal and O(logn) for query. The second dynamic algorithm, based on the data structure called linearised tree, runs in time O(logn) for insertion, removal and query. We discuss differences and similarities of these two data structures through theoretical and experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Corneil, D.: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Applied Mathematics 138(3), 371–379 (2004)
Deng, X., Hell, P., Huang, J.: Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM Journal on Computing 25(2), 390–403 (1996)
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)
Katz, M.J., Nielsen, F., Segal, M.: Maintenance of a piercing set for intervals with applications. Algorithmica 36(1), 59–73 (2003)
Lipton, R., Tompkins, A.: Online interval scheduling. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 302–311 (1994)
Heggernes, P., Meister, D., Papadopoulos, C.: A new representation of proper interval graphs with an application to clique-width. Electronic Notes in Discrete Mathematics 32, 27–34 (2009)
Kaplan, H., Molad, E., Tarjan, R.: Dynamic rectangular intersection with priorities. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 639–648 (June 2003)
Kleinberg, J., Tardos, E.: Algorithm Design (2006)
Kolen, A., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: A survey. Naval Research Logistics 54(5), 530–543 (2007)
Sleator, D., Tarjan, R.: A Data Structure for Dynamic Trees. Journal of Computer and System Sciences 26(3), 362–391 (1983)
Sleator, D., Tarjan, R.: Self-adjusting binary search trees. Journal of the ACM 32(3), 652–686 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavruskin, A., Khoussainov, B., Kokho, M., Liu, J. (2013). Dynamising Interval Scheduling: The Monotonic Case. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)