Pages that link to "Item:Q3434990"
From MaRDI portal
The following pages link to Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (Q3434990):
Displaying 6 items.
- Optimal on-line colorings for minimizing the number of ADMs in optical networks (Q972358) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks (Q4210085) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
