Dynamic location problems with limited look-ahead

DOI10.1016/S0304-3975(00)00140-7MaRDI QIDQ5941730zbMATH OpenWikidataFDO

Authors Fan Chung, Ron Graham

Publication date 23 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00140-7

zbMATH Keywords

Internet web page caching

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• New Ressults on Server Problems
• Competitive algorithms for server problems
• A competitive 2-server algorithm
• A deterministic O(k^ 3)-competitive k-server algorithm for the circle
• On the power of lookahead in on-line server routing problems

Cites work

• A dynamic location problem for graphs
• A Limit Theorem for (min, +) Matrix Multiplication
• Competitive k-server algorithms
• Competitive algorithms for server problems
• scientific article; zbMATH DE number 4049076 (Why is no real title available?)
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 65696 (Why is no real title available?)
• On the power of randomization in on-line algorithms
• Online algorithms. The state of the art

Cited in

(5)

• Preemptively guessing the center
• Multiple anticipatory moves of a server on a line
• Dynamic resource location with tropical algebra
• Cost thresholds for dynamic resource location
• On the power of lookahead in on-line server routing problems

This page was built for publication: Dynamic location problems with limited look-ahead

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