Online selection of intervals and t-intervals
From MaRDI portal
Publication:391644
DOI10.1016/J.IC.2013.10.004zbMATH Open1358.68323OpenAlexW1977737452MaRDI QIDQ391644FDOQ391644
Authors: Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai 
Publication date: 10 January 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.10.004
Recommendations
Cites Work
- Title not available (Why is that?)
- On-line scheduling of jobs with fixed start and end times
- Title not available (Why is that?)
- Bounding the Power of Preemption in Randomized Scheduling
- Improved randomized results for the interval selection problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling Split Intervals
- Online independent sets.
- On the approximability of an interval scheduling problem
- Online scheduling with interval conflicts
- Lower bounds for on-line graph coloring
- Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
- An improved randomized on-line algorithm for a weighted interval selection problem
- Optimization problems in multiple-interval graphs
- Interval selection: Applications, algorithms, and lower bounds
- Using fractional primal-dual to schedule split intervals with demands
Cited In (6)
- A randomized algorithm for online scheduling with interval conflicts
- Any-order online interval selection
- Competitive algorithms for multistage online scheduling
- On-line selection of an acceptable pair
- Online algorithms for the maximum \(k\)-interval coverage problem
- Online selection of intervals and \(t\)-intervals
This page was built for publication: Online selection of intervals and \(t\)-intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391644)
