scientific article

From MaRDI portal
Publication:4010306

zbMath0800.68489MaRDI QIDQ4010306

Lawrence L. Larmore, Marek Chrobak

Publication date: 27 September 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

The weighted 2-server problemOn the competitive ratio of the work function algorithm for the \(k\)-server problemThe 2-evader problemEfficient offline algorithms for the bicriteria \(k\)-server problem and online applicationsAn on-line multi-CBR agent dispatching algorithmRandomized competitive analysis for two server problemsThe work function algorithm for the paging problemOn the additive constant of the \(k\)-server work function algorithmRandomized algorithms for metrical task systemsCompetitive algorithms for the bicriteria \(k\)-server problemThe \(k\)-server problemRandomized Competitive Analysis for Two-Server ProblemsThe \(k\)-server problem with advice in \(d\) dimensions and on the sphereTight bounds for double coverage against weak adversariesOn the Additive Constant of the k-Server Work Function AlgorithmMetrical service systems with multiple serversOnline computation with adviceKnowledge state algorithmsDynamic location problems with limited look-aheadPaging with request setsA new upper bound on the work function algorithm for the \(k\)-server problemStochastic dominance and the bijective ratio of online algorithmsUnfair problems and randomized algorithms for metrical task systemsThe online \(k\)-server problem with rejectionOn list update and work function algorithms.The 3-server problem in the plane.A randomized algorithm for two servers on the line.A general decomposition theorem for the \(k\)-server problemThe online \(k\)-server problem with max-distance objectiveTrackless online algorithms for the server problem




This page was built for publication: