Improved Randomized Results for That Interval Selection Problem

DOI10.1007/978-3-540-87744-8_32zbMath1158.68340OpenAlexW1921120451MaRDI QIDQ3541101

Asaf Levin, Leah Epstein

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_32

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (5)

Online interval scheduling on a single machine with finite lookahead ⋮ Competitive algorithms for multistage online scheduling ⋮ Interval scheduling on related machines ⋮ Improved randomized results for the interval selection problem ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs

Cites Work

• Unnamed Item
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Randomized online interval scheduling
• On-line scheduling of jobs with fixed start and end times
• Note on scheduling intervals on-line
• On the \(k\)-coloring of intervals
• An improved randomized on-line algorithm for a weighted interval selection problem
• Interval scheduling: A survey
• Online Interval Scheduling: Randomized and Multiprocessor Cases
• Bounding the Power of Preemption in Randomized Scheduling

This page was built for publication: Improved Randomized Results for That Interval Selection Problem