Any-order online interval selection

DOI10.1007/978-3-031-49815-2_13MaRDI QIDQ6574946FDOQ6574946

Authors: Allan Borodin, Christodoulos Karavasilis 

Publication date: 19 July 2024

zbMATH Keywords

interval selectiononline algorithmsschedulingcall control

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cites Work

• Randomized online interval scheduling
• On-line scheduling of jobs with fixed start and end times
• Note on scheduling intervals on-line
• Improved randomized online scheduling of intervals and jobs
• Title not available (Why is that?)
• On-line scheduling of equal-length intervals on parallel machines
• Interval scheduling: A survey
• Online scheduling with interval conflicts
• Title not available (Why is that?)
• The \(k\)-server problem
• Scheduling equal-length jobs on identical parallel machines
• On the competitive ratio for online facility location
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Improved Randomized Results for That Interval Selection Problem
• Admission control to minimize rejections and online set cover with repetitions
• A note on scheduling equal-length jobs to maximize throughput
• 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
• Online selection of intervals and \(t\)-intervals
• A short proof that `proper = unit'
• Online knapsack problem with removal cost
• On sum coloring and sum multi-coloring for restricted families of graphs
• The CNN problem and other \(k\)-server variants
• Efficient On-Line Call Control Algorithms
• Lower bounds for two call control problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound for two-server balancing algorithms
• Space-constrained interval selection
• Online C-benevolent job scheduling on multiple machines
• Memoryless algorithms for the generalized k-server problem on uniform metrics
• The online \(k\)-taxi problem
• Title not available (Why is that?)

This page was built for publication: Any-order online interval selection

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