arXiv (All)
open access
Capacitated Line Aggregation with Maximum Delay
We study capacitated line aggregation with per-batch maximum delay. Requests arrive over time at locations on a rooted half-line and are served in instantaneous batches of at most $k$ requests. Each batch pays the distance to its farthest request plus the waiting time of its oldest request. The obje
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
- Online Multi-Level Aggregation with Per-Batch Maximum Delay#999842
- The Sync Heap: Delete First, Ask Questions Later#1357239
- Lipschitz Bandits with Arbitrary Feedback Delays#612467
- Lipschitz Bandits with Arbitrary Feedback Delays#610990
- One Sum To Rule Them All: A Second Order Master Rate Sum Rule for Charm Decays#684369
Record · ID 1401662
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