arXiv (All)
open access
Robust logarithmic lower bound on shared-resource cost for $f$-routing
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
- Robust logarithmic lower bound on shared-resource cost for $f$-routing#618741
- An inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs#1012787
- Safe and efficient active network programming#328672
- Resource allocation in sparse graphs#306912
- Extremal hypergraphs without generalized 4-cycles#1142055
Record · ID 620420
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