The following pages link to Lower bounds for compact routing (Q4593958):
Displaying 9 items.
- The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
- A survey on interval routing (Q1575744) (← links)
- On the complexity of multi-dimensional interval routing schemes (Q1575745) (← links)
- The compactness of adaptive routing tables (Q1827290) (← links)
- (Q4262693) (← links)
- (Q4736828) (← links)
- Interval routing schemes allow broadcasting with linear message-complexity (Q5138363) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Constraint satisfaction, packet routing, and the lovasz local lemma (Q5495839) (← links)