arXiv (All)
open access
Near-Optimal Online Metric Matching on $Δ$-ary HST
In the online metric matching problem, we have $n$ servers with known locations in some metric space. Requests arrive one-by-one at certain locations, and upon arrival a request must be matched to a server that was not matched to a previous request. The goal is to minimize the matching cost. For ran
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 note on the partition bound for one-way classical communication complexity#974136
- Spatial segregation as the origin of anisotropic satellite quenching in haloes and beyond#1077666
- The Economics of the Internet Backbone#942209
- Diffusion Approximations for Thompson Sampling in the Small Gap Regime#158590
- Secure Pseudonymetry with DSSS Watermarking for LEO Satellites#780991
Record · ID 1051785
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