Improved randomized results for the interval selection problem
DOI10.1016/J.TCS.2010.04.042zbMATH Open1196.68323OpenAlexW2055364146MaRDI QIDQ986549FDOQ986549
Authors: Leah Epstein, Asaf Levin 
Publication date: 11 August 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.042
Recommendations
- Improved Randomized Results for That Interval Selection Problem
- An improved randomized on-line algorithm for a weighted interval selection problem
- Interval selection: Applications, algorithms, and lower bounds
- Randomized algorithms in interval global optimization
- Optimal selection of stochastic intervals under a sum constraint
- Optimal randomized algorithm for the density selection problem
- Improved algorithms for several parameterized problems based on random methods
- A random-size subset approach to the selection problem
- An improved, randomized algorithm for parallel selection with an experimental study
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Online interval scheduling: Randomized and multiprocessor cases
- 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
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- Bounding the Power of Preemption in Randomized Scheduling
- Interval scheduling: A survey
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Improved Randomized Results for That Interval Selection Problem
- An improved randomized on-line algorithm for a weighted interval selection problem
Cited In (15)
- Online selection of intervals and \(t\)-intervals
- Online interval scheduling on two related machines: the power of lookahead
- Online scheduling of jobs with fixed start times on related machines
- On-line scheduling of equal-length intervals on parallel machines
- An improved online algorithm for the online preemptive scheduling of equal-length intervals on a single machine with lookahead
- Online C-benevolent job scheduling on multiple machines
- Online interval scheduling to maximize total satisfaction
- Improved Randomized Results for That Interval Selection Problem
- Online Interval Scheduling: Randomized and Multiprocessor Cases
- Improved bounds for randomized preemptive online matching
- An improved randomized on-line algorithm for a weighted interval selection problem
- Improved randomized online scheduling of intervals and jobs
- Interval selection: Applications, algorithms, and lower bounds
- Online selection of intervals and \(t\)-intervals
- Online interval scheduling with a bounded number of failures
This page was built for publication: Improved randomized results for the interval selection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986549)
