Any-order online interval selection

DOI10.1007/978-3-031-49815-2_13MaRDI QIDQ6574946zbMATH OpenFDO

Authors Allan Borodin, Christodoulos Karavasilis

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49815-2_13

zbMATH Keywords

call controlinterval selectiononline algorithmsscheduling

Mathematics Subject Classification ID

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

Cites work

• A lower bound for two-server balancing algorithms
• A note on scheduling equal-length jobs to maximize throughput
• A short proof that `proper = unit'
• Admission control to minimize rejections and online set cover with repetitions
• An improved randomized on-line algorithm for a weighted interval selection problem
• Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
• Efficient On-Line Call Control Algorithms
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 1263237 (Why is no real title available?)
• scientific article; zbMATH DE number 1830730 (Why is no real title available?)
• scientific article; zbMATH DE number 7765369 (Why is no real title available?)
• Improved randomized online scheduling of intervals and jobs
• Improved Randomized Results for That Interval Selection Problem
• Interval scheduling: A survey
• Lower bounds for two call control problems
• Memoryless algorithms for the generalized k-server problem on uniform metrics
• Note on scheduling intervals on-line
• On sum coloring and sum multi-coloring for restricted families of graphs
• On the competitive ratio for online facility location
• On-line scheduling of equal-length intervals on parallel machines
• On-line scheduling of jobs with fixed start and end times
• Online C-benevolent job scheduling on multiple machines
• Online knapsack problem with removal cost
• Online scheduling with interval conflicts
• Online selection of intervals and t-intervals
• Randomized online interval scheduling
• Scheduling equal-length jobs on identical parallel machines
• Space-constrained interval selection
• The \(k\)-server problem
• The CNN problem and other k-server variants
• The online k-taxi problem

Cited in

(2)

• Random-order online independent set of intervals and hyperrectangles
• Online interval scheduling with predictions

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)