arXiv (OAI Expanded)
open access
Degree-Parameterized Analysis of Sampling-Based Online Matching
We study edge-weighted online bipartite matching under random arrival order, parameterized by the maximum offline degree $d$ and sampling fraction $θ$. We analyze two sampling-based frameworks. For \emph{Deterministic Greedy Sampling}, which computes prices from a fixed-size initial sample and then
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
- Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals#1063372
- The Exact Law of Large Numbers for Independent Random Matching#21082
- Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling#1117362
- Dynamic Directed Random Matching#21611
- Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric#1062747
Record · ID 1083917
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