Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the additive constant of the \(k\)-server work function algorithm

From MaRDI portal
Publication:1675878
Jump to:navigation, search

DOI10.1016/j.ipl.2010.09.003zbMath1379.68360OpenAlexW1995082171MaRDI QIDQ1675878

Adi Rosén, Amos Korman, Yuval Emek, Pierre Fraigniaud

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.003


zbMATH Keywords

online algorithms\(k\)-server problem


Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)


Related Items (1)

A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Competitive algorithms for server problems
  • Online Computation with Advice
  • On the k -server conjecture


This page was built for publication: On the additive constant of the \(k\)-server work function algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1675878&oldid=13988252"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki