arXiv (All)
open access
Online Covering with Maximum Delay under Subadditive Service Costs
We study online covering in which each instantaneous service pays its purchase cost and one maximum waiting time, with no effect on future requests. For static realizable services, monotone subadditivity suffices for optimal competitive ratios; submodularity is unnecessary. A normalized monotone sub
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
- The Economics of the Internet Backbone#942209
- A Dashboard for Online Pricing#941699
- The Dimensions of Reputation in Electronic Markets#941646
- Gatekeepers and the endogenous design of consumer preferences under personalized pricing#468377
- Penerapan Sistem Rekomendasi Produk pada Marketplace Menggunakan Metode Colaborative Filtering#1066828
Record · ID 1117006
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