Abstract
We consider the class of strip graphs, a generalization of interval graphs. Intervals are assigned to rows such that two vertices have an edge between them if either their intervals intersect or they belong to the same row. We show that recognition of the class of strip graphs is \(\mathcal{NP}\)-complete even if all intervals are of length 2. Strip graphs are important to the study of job selection, where we need an equivalence relation to connect multiple intervals that belong to the same job.
The problem we consider is Job Interval Selection (JISP) on m machines. In the single-machine case, this is equivalent to Maximum Independent Set on strip graphs. For m machines, the problem is to choose a maximum number of intervals, one from each job, such that the resulting choices form an m-colorable interval graph. We show the single-machine case to be fixed-parameter tractable in terms of the maximum number of overlapping rows. We also use a concatenation operation on strip graphs to reduce the m-machine case to the 1-machine case. This shows that m-machine JISP is fixed-parameter tractable in the total number of jobs.
Supported by a grant from RANNÍS — The Icelandic Centre for Research.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Halldórsson, M.M., Naor, J(S.), Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal of Computing 36, 1–15 (2006)
Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. In: FOCS 2001: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, Washington, DC, USA, p. 348. IEEE Computer Society Press, Los Alamitos (2001)
Crama, Y., Spieksma, F.C.R.: Scheduling jobs of equal length: complexity, facets and computational results. Math. Program. 72(3), 207–227 (1996)
Gyárfás, A., West, D.B.: Multitrack interval graphs. Congressus Numerantium 109, 109–116 (1995)
Halldórsson, M.M., Rajagopalan, S., Shachnai, H., Tomkins, A.: Scheduling multiple resources (unpublished manuscript) (1999)
Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. ACM 21(4), 569–575 (1974)
Nakajima, K., Hakimi, S.L.: Complexity results for scheduling tasks with discrete starting times. Journal of Algorithms 3, 344–361 (1982)
West, D.B., Shmoys, D.B.: Recognizing graphs with fixed interval number is NP-complete. Discrete Appl. Math. 8, 295–305 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M., Karlsson, R.K. (2006). Strip Graphs: Recognition and Scheduling. In: Fomin, F.V. (eds) Graph-Theoretic Concepts in Computer Science. WG 2006. Lecture Notes in Computer Science, vol 4271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11917496_13
Download citation
DOI: https://doi.org/10.1007/11917496_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48381-6
Online ISBN: 978-3-540-48382-3
eBook Packages: Computer ScienceComputer Science (R0)