The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces

DOI10.1007/978-3-540-73951-7_30zbMATH Open1209.90297OpenAlexW1693780374MaRDI QIDQ3603539FDOQ3603539

Authors: Marcin Bienkowski, Jarosław Kutyłowski 

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_30

Recommendations

• The \(k\)-resource problem in uniform metric spaces
• Competitive algorithms for generalized \(k\)-server in uniform metrics
• A polylogarithmic-competitive algorithm for the \(k\)-server problem
• Randomized algorithm for the \(k\)-server problem on decomposable spaces
• scientific article; zbMATH DE number 6469207

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Combinatorial optimization (90C27)

Cited In (2)

• The \(k\)-resource problem in uniform metric spaces
• A general decomposition theorem for the \(k\)-server problem

This page was built for publication: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces

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