The online k-server problem with rejection

DOI10.1016/J.DISOPT.2014.03.002zbMATH Open1308.68153OpenAlexW2013536508MaRDI QIDQ2339820FDOQ2339820

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Online algorithms. The state of the art
• Scheduling with machine cost and rejection
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection
• Competitive algorithms for server problems
• An optimal on-line algorithm for metrical task system
• On the k -server conjecture
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• New Ressults on Server Problems
• The \(k\)-server problem
• Bin packing with rejection revisited
• Online scheduling with machine cost and rejection
• Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection
• Graph coloring with rejection
• Bin packing problems with rejection penalties and their dual problems

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)