Approximating Interval Scheduling Problems with Bounded Profits

DOI10.1007/978-3-540-75520-3_44MaRDI QIDQ3527237zbMATH OpenOpenAlexFDO

Authors Israel Beniaminy, Meir Ovadia, Zeev Nutov

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_44

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1182771
• On the approximability of an interval scheduling problem
• scientific article; zbMATH DE number 2038779
• Online interval scheduling to maximize total satisfaction
• Online Interval Scheduling to Maximize Total Satisfaction

Cited in

(2)

• scientific article; zbMATH DE number 1182771 (Why is no real title available?)
• scientific article; zbMATH DE number 850325 (Why is no real title available?)

This page was built for publication: Approximating Interval Scheduling Problems with Bounded Profits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527237)