Serving Online Requests with Mobile Servers

DOI10.1007/978-3-662-48971-0_62zbMath1472.68219arXiv1404.5510OpenAlexW2295789962MaRDI QIDQ3459911

Fabian Kuhn, Abdolhamid Ghodselahi

Publication date: 11 January 2016

Published in: Theory of Computing Systems, Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5510

zbMATH Keywords

competitive analysismovement minimizationgeneral cost functionmobile resourcesonline requests

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Network design and communication in computer systems (68M10) Online algorithms; streaming algorithms (68W27) Computer system organization (68Mxx) Operations research and management science (90Bxx)

Related Items (2)

Serving Online Requests with Mobile Servers ⋮ Online facility location with mobile facilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online facility location with facility movements
• Online facility location with mobile facilities
• Facility reallocation on the line
• Reallocating multiple facilities on the line
• On the competitive ratio for online facility location
• Minimizing movement in mobile facility location problems
• Serving Online Requests with Mobile Servers
• Competitive algorithms for server problems
• A new greedy approach for facility location problems
• Competitive paging algorithms
• On the k -server conjecture
• The facility location problem with general cost functions
• Dynamic Beats Fixed
• Online service with delay
• Local search heuristic for k-median and facility location problems
• Algorithms – ESA 2004
• A Polylogarithmic-Competitive Algorithm for the k-Server Problem
• A tight bound on approximating arbitrary metrics by tree metrics
• Managing multiple mobile resources
• On page migration and other relaxed task systems

This page was built for publication: Serving Online Requests with Mobile Servers