The complexity of scheduling TV commercials

DOI10.1016/S1571-0661(05)80043-XzbMath1264.68088OpenAlexW2081820323MaRDI QIDQ4923372

Colm Ó Dúnlaing, Søren Riis, Klemens Hägele

Publication date: 6 June 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(05)80043-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A branch and bound algorithm for optimal television commercial scheduling

Cites Work

• A new polynomial-time algorithm for linear programming
• Reducibility among Combinatorial Problems
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of scheduling TV commercials