arXiv (All)
open access
The Cube-Root Phenomenon in Online Carpooling
We consider the online carpooling problem, where edges arrive online and must be oriented immediately while keeping the discrepancy between the indegree and outdegree at each vertex small. We prove that the natural Greedy algorithm incurs discrepancy $O(\min\{T^{1/3},n\})$ after $T$ arrivals. This r
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
- Sampling Matchings in Near-linear Time#1036324
- An arbitrary-order BGG-based discrete scheme for the Reissner--Mindlin plate problem on polygonal meshes#1123512
- OR-Transformer: Scaling Real-Time Decision-Making to 1,000 Items#927477
- A Complete Characterization of Near Outer-Planar Graphs#938987
- New structure for old graphs: Twin-width through the lens of classical parameters / Simon Vincent Raßmann ; Gutachter: Pascal Schweitzer, Kord Eickmeyer#1065184
Record · ID 1035754
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