zbMATH — the first resource for mathematics

Interval scheduling and colorful independent sets. (English) Zbl 1328.90065
Summary: Numerous applications in scheduling, such as resource allocation or steel manufacturing, can be modeled using the NP-hard Independent Set problem (given an undirected graph and an integer \(k\), find a set of at least \(k\) pairwise non-adjacent vertices). Here, one encounters special graph classes like 2-union graphs (edge-wise unions of two interval graphs) and strip graphs (edge-wise unions of an interval graph and a cluster graph), on which Independent Set remains NP-hard but admits constant ratio approximations in polynomial time. We study the parameterized complexity of Independent Set on 2-union graphs and on subclasses like strip graphs. Our investigations significantly benefit from a new structural “compactness” parameter of interval graphs and novel problem formulations using vertex-colored interval graphs. Our main contributions are as follows: 1. We show a complexity dichotomy: restricted to graph classes closed under induced subgraphs and disjoint unions, Independent Set is polynomial-time solvable if both input interval graphs are cluster graphs, and is NP-hard otherwise. 2. We chart the possibilities and limits of effective polynomial-time preprocessing (also known as kernelization). 3. We extend M. M. Halldórsson and R. K. Karlsson’s fixed-parameter algorithm [Lecture Notes in Computer Science 4271, 137–146 (2006; Zbl 1167.68409)] for Independent Set on strip graphs parameterized by the structural parameter “maximum number of live jobs” to show that the problem (also known as Job Interval Selection) is fixed-parameter tractable with respect to the parameter \(k\) and generalize their algorithm from strip graphs to 2-union graphs. Preliminary experiments with random data indicate that Job Interval Selection with up to 15 jobs and \(5\cdot 10^5\) intervals can be solved optimally in less than \(5\) min.

90B35 Deterministic scheduling theory in operations research
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
05C15 Coloring of graphs and hypergraphs
90C35 Programming involving graphs or networks
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Full Text: DOI arXiv
[1] Alon, N; Yuster, R; Zwick, U, Color-coding, Journal of the ACM, 42, 844-856, (1995) · Zbl 0885.68116
[2] Bafna, V; Narayanan, BO; Ravi, R, Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles), Discrete Applied Mathematics, 71, 41-53, (1996) · Zbl 0873.92011
[3] Bar-Yehuda, R; Halldórsson, MM; Naor, J; Shachnai, H; Shapira, I, Scheduling split intervals, SIAM Journal on Computing, 36, 1-15, (2006) · Zbl 1111.68046
[4] Bodlaender, HL; Jansen, BMP; Kratsch, S, Kernelization lower bounds by cross-composition, SIAM Journal on Discrete Mathematics, 28, 277-305, (2014) · Zbl 1295.05222
[5] Brandstädt, A., Le, V. B., & Spinrad, J. P. (1999). Graph classes: A survey. Philadelphia: SIAM. · Zbl 0919.05001
[6] Chen, J., Lu, S., Sze, S. H., Zhang, F. (2007). Improved algorithms for path, matching, and packing problems. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 298-307). New York: SIAM. · Zbl 1302.90169
[7] Chuzhoy, J; Ostrovsky, R; Rabani, Y, Approximation algorithms for the job interval selection problem and related scheduling problems, Mathematics of Operations Research, 31, 730-738, (2006) · Zbl 1278.90146
[8] Corneil, DG; Olariu, S; Stewart, L, The LBFS structure and recognition of interval graphs, SIAM Journal on Discrete Mathematics, 23, 1905-1953, (2009) · Zbl 1207.05131
[9] Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. New York: Springer. · Zbl 1358.68006
[10] Fellows, MR; Gaspers, S; Rosamond, FA, Parameterizing by the number of numbers, Theory of Computing Systems, 50, 675-693, (2012) · Zbl 1253.68173
[11] Flum, J., & Grohe, M. (2006). Parameterized complexity theory. Berlin: Springer. · Zbl 1143.68016
[12] Fulkerson, DR; Gross, OA, Incidence matrices and interval graphs, Pacific Journal of Mathematics, 15, 835-855, (1965) · Zbl 0132.21001
[13] Garey, MR; Johnson, DS; Stockmeyer, L, Some simplified NP-complete graph problems, Theoretical Computer Science, 1, 237-267, (1976) · Zbl 0338.05120
[14] Guo, J; Niedermeier, R, Invitation to data reduction and problem kernelization, SIGACT News, 38, 31-45, (2007)
[15] Gyárfas, A; West, DB, Multitrack interval graphs, Congressus Numerantium, 109, 109-116, (1995) · Zbl 0904.05050
[16] Halldórsson, M. M., Karlsson, R. K. (2006). Strip graphs: Recognition and scheduling. In: Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science (Vol. 4271, pp. 137-146). Berlin: Springer.
[17] Höhn, W; König, FG; Möhring, RH; Lübbecke, ME, Integrated sequencing and scheduling in coil coating, Management Science, 57, 647-666, (2011) · Zbl 1214.90042
[18] Impagliazzo, R; Paturi, R; Zane, F, Which problems have strongly exponential complexity?, Journal of Computer and System Sciences, 63, 512-530, (2001) · Zbl 1006.68052
[19] Jiang, M, On the parameterized complexity of some optimization problems related to multiple-interval graphs, Theoretical Computer Science, 411, 4253-4262, (2010) · Zbl 1213.68461
[20] Jiang, M, Recognizing \(d\)-interval graphs and \(d\)-track interval graphs, Algorithmica, 66, 541-563, (2013) · Zbl 1267.68121
[21] Kolen, AW; Lenstra, JK; Papadimitriou, CH; Spieksma, FCR, Interval scheduling: A survey, Naval Research Logistics, 54, 530-543, (2007) · Zbl 1143.90337
[22] Koutis, I., Williams, R. (2009). Limits and applications of group algebras for parameterized problems. In: Proceedings of the 36th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science (Vol. 5555, pp. 653-664). New York: Springer. · Zbl 1248.68251
[23] Kratsch, S, Recent developments in kernelization: A survey, Bulletin of the European Association for Theoretical Computer Science, 113, 58-97, (2014) · Zbl 1409.68144
[24] Kung, HT; Luccio, F; Preparata, FP, On finding the maxima of a set of vectors, Journal of the ACM, 22, 469-476, (1975) · Zbl 0316.68030
[25] Lokshtanov, D; Marx, D; Saurabh, S, Lower bounds based on the exponential time hypothesis, Bulletin of the European Association for Theoretical Computer Science, 105, 41-72, (2011) · Zbl 1258.68068
[26] Marx, D. (2011). Fixed-parameter tractable scheduling problems. In: Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). · Zbl 1278.90146
[27] Mnich, M., Wiese, A. (2014). Scheduling and fixed-parameter tractability. In: Proceedings of the 17th Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science (Vol. 8494, pp. 381-392). Berlin: Springer. · Zbl 1332.68088
[28] Möhring, RH, Algorithm engineering and industrial applications, Information Technology, 53, 302-311, (2011)
[29] Nakajima, K; Hakimi, SL, Complexity results for scheduling tasks with discrete starting times, Journal of Algorithms, 3, 344-361, (1982) · Zbl 0535.68017
[30] Niedermeier, R. (2006). Invitation to fixed-parameter algorithms. Oxford: Oxford University Press. · Zbl 1095.68038
[31] Scheinerman, E, Random interval graphs, Combinatorica, 8, 357-371, (1988) · Zbl 0659.05078
[32] Schrijver, A. (2003). Combinatorial optimization: Polyhedra and efficiency (Vol. A). Berlin: Springer. · Zbl 1041.90001
[33] Spieksma, FCR, On the approximability of an interval scheduling problem, Journal of Scheduling, 2, 215-227, (1999) · Zbl 0938.90034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.