arXiv (All)
open access
On the Offline Version of the Time-Optimal k-Server Problem
We consider the offline problem of parallel relocation of k identical mobile resources. After each request, known in advance, the resources may move simultaneously, and the duration of a step is determined by the longest individual movement. This model is equivalent to the offline version of the tim
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distributed Algorithms for Near-Equitable Coloring#429339
- On (Directed) Width-Parameters of Geometric Spanners#1036492
- Using surrogate servers for content delivery network infrastructure with guaranteed QoS#1025185
- VTRQ: Enabling Verifiable Trajectory Range Queries in Hybrid-Storage Blockchains#480140
- Multiple roles for kinases in DNA replication#652830
Record · ID 1051673
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive