arXiv (All)
open access
FirstFit online coloring in the random order model
The average performance of FirstFit online coloring on trees in the random order model is completely determined in recent works of Frei et al. and Bosek et al., showing $Θ(\log n /\log\log n)$ number of colors, improving the $Θ(\log n)$ colors in the adversarial model. We provide a few further resul
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
- FirstFit online coloring in the random order model#796830
- Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels#820895
- Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings#183190
- Beyond Fixed Luminance: Towards Panchromatic and Orthochromatic Image Colorization#444651
- Ordered matchings versus triangles via pseudorandom triangle-free graphs#1014222
Record · ID 798243
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