Pages that link to "Item:Q5917575"
From MaRDI portal
The following pages link to Optimal oblivious routing in polynomial time (Q5917575):
Displaying 16 items.
- An optimal time bound for oblivious routing (Q908701) (← links)
- Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Oblivious routing on node-capacitated and directed graphs (Q2921741) (← links)
- THRESHOLD RULES FOR ONLINE SAMPLE SELECTION (Q3084694) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
- A Time-Randomness Trade-Off for Oblivious Routing (Q3468611) (← links)
- (Q5075823) (← links)
- (Q5091130) (← links)
- (Q5743510) (← links)
- Optimal oblivious routing in polynomial time (Q5901088) (← links)
- Affine routing for robust network design (Q6065910) (← links)
- Optimal oblivious reconfigurable networks (Q6083590) (← links)
- An efficient approach to optimization of semi‐stable routing in multicommodity flow networks (Q6087135) (← links)