The online k-server problem with rejection

DOI10.1016/J.DISOPT.2014.03.002MaRDI QIDQ2339820zbMATH OpenOpenAlexFDO

Authors Emese Bittner, Csanád Imreh, Judit Nagy-György

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.03.002

zbMATH Keywords

online algorithmscompetitive analysis\(k\)-server problems

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The 3-server problem in the plane.
• A new upper bound on the work function algorithm for the \(k\)-server problem
• scientific article; zbMATH DE number 1500547
• On the competitive ratio of the work function algorithm for the k-server problem
• Online k-server routing problems

Cites work

• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• An optimal on-line algorithm for metrical task system
• Bin packing problems with rejection penalties and their dual problems
• Bin packing with rejection revisited
• Competitive algorithms for server problems
• Graph coloring with rejection
• Multiprocessor Scheduling with Rejection
• New Ressults on Server Problems
• On the k -server conjecture
• On the competitive ratio of the work function algorithm for the k-server problem
• Online algorithms. The state of the art
• Online scheduling with machine cost and rejection
• Parameter learning online algorithm for multiprocessor scheduling with rejection
• Preemptive multiprocessor scheduling with rejection
• Scheduling with machine cost and rejection
• The \(k\)-server problem
• The design and analysis of a modified work function algorithm for solving the on-line \(k\)-server problem

Cited in

(1)

• Admission control to minimize rejections and online set cover with repetitions

This page was built for publication: The online \(k\)-server problem with rejection

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