arXiv (All)
open access
A Tight Second-Order Lower Bound for Routing Labels in Trees
In the designer-port routing-labeling problem, every vertex of a rooted tree receives a binary label and the child edges receive distinct port numbers. Given only the labels of a source and a destination, a decoder must return the first port on their path. Gawrychowski, Janczewski, and Lopuszanski g
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
- ReCAP: A Study of Downlink Optimization Methods Using MMS as a Template#651526
- An inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs#1012787
- Characterizations and Complexity of Minimum Forward and Integer Cycle Bases#924213
- Characterizations and Complexity of Minimum Forward and Integer Cycle Bases#919982
- Economy of scale in algorithm design : approximation algorithms for submodular optimization and network design#195727
Record · ID 1154933
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