arXiv (All)
open access
Tight Bounds on the Cost of Adaptivity for the Meyerson Sketch
In online facility location, points arrive one at a time, and the algorithm must either open a facility at the arriving point or route the point to an existing facility. The Meyerson sketch opens a facility at each arriving point with probability proportional to the point's distance to the closest 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
- Graphs with Minimum Algebraic Connectivity I: Proofs of Aldous-Fill and Guiduli-Mohar Conjectures#1062585
- DisCoMBO: Steering Expert-in-the-Loop Black Box Optimization via Distributional Conformance#1131314
- Sample Average Approximation for Distributionally Robust Optimization with $ϕ$-divergences#924540
- Sample Average Approximation for Distributionally Robust Optimization with $ϕ$-divergences#920309
- Benign nonconvexity of synchronization landscape induced by graph skeletons#974285
Record · ID 974773
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