Interval Selection with Machine-Dependent Intervals

DOI10.1007/978-3-642-40104-6_15zbMath1391.90244OpenAlexW1573772353MaRDI QIDQ2842155

Matúš Mihalák, Kateřina Böhmová, Yann Disser, Peter Widmayer

Publication date: 12 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/76420

zbMATH Keywords

intervalscomplexityschedulingapproximation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

No-Wait Scheduling for Locks ⋮ Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores