Interval selection: Applications, algorithms, and lower bounds

DOI10.1016/S0196-6774(02)00291-2zbMath1033.90104OpenAlexW2136149017MaRDI QIDQ4419479

Erlebach, Thomas, Frits C. R. Spieksma

Publication date: 13 August 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00291-2

zbMATH Keywords

AlgorithmsApproximationLower boundsIndependent setIntervals

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)

Related Items (14)

Improved algorithms for resource allocation under varying capacity ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Online selection of intervals and \(t\)-intervals ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Toward a model for backtracking and dynamic programming ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ Online C-benevolent job scheduling on multiple machines ⋮ Improving LTL truck load utilization on line ⋮ Runway sequencing with holding patterns ⋮ Randomized priority algorithms ⋮ DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM ⋮ Scheduling with a minimum number of machines ⋮ Priority algorithms for the subset-sum problem ⋮ Fair and efficient cake division with connected pieces

This page was built for publication: Interval selection: Applications, algorithms, and lower bounds