arXiv (All)
open access
A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees
We study the \emph{online transportation problem}, in which $n$ requests arriving sequentially in a metric space must be irrevocably assigned to $k$ capacitated facilities. Beyond classical logistics applications, this problem models resource-allocation tasks arising in machine learning, including o
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
- A Comparative Study of Bayesian Contextual Bandits for Real-Time Warehouse Sorter Optimization#1110280
- Optimal Service Commitments in Traveling Salesman Problems with Stochastic Demand#999934
- A Deterministic Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving#792807
- A Deterministic Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving#788803
- Optimal Multi-RIS Placement: Coverage-Guaranteed Sum Rate Maximization Under Inhomogeneous User Distributions#986886
Record · ID 1144019
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