Pages that link to "Item:Q5901088"
From MaRDI portal
The following pages link to Optimal oblivious routing in polynomial time (Q5901088):
Displaying 13 items.
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914) (← links)
- Oblivious routing with limited buffer capacity (Q1176105) (← links)
- Tight bounds for oblivious routing in the hypercube (Q3357537) (← links)
- A Time-Randomness Trade-Off for Oblivious Routing (Q3468611) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- (Q5091130) (← links)
- From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (Q5108243) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- (Q5874505) (← links)
- Optimal oblivious routing in polynomial time (Q5917575) (← links)
- Optimal oblivious reconfigurable networks (Q6083590) (← links)