Algorithms and Computation

DOI10.1007/11602613zbMATH Open1175.68032OpenAlexW2304246803MaRDI QIDQ5897889FDOQ5897889

Authors: Satoshi Fujita 

Publication date: 14 November 2006

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

Full work available at URL: https://doi.org/10.1007/11602613

Recommendations

• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
• The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
• Movable dominating sensor sets in networks
• An analysis of service schedules for the mobile k-server problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (1)

• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

This page was built for publication: Algorithms and Computation

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