The following pages link to Oblivious network design (Q3581559):
Displayed 20 items.
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- Randomized oblivious integral routing for minimizing power cost (Q897952) (← links)
- Algorithms for the universal and a priori TSP (Q924875) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Dynamic scheduling in distributed transactional memory (Q2121056) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- On the Complexity of Master Problems (Q2946425) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs (Q3088084) (← links)
- Distributed Distance-Bounded Network Design Through Distributed Convex Programming (Q3300803) (← links)
- (Q5075788) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5899559) (← links)
- Universal Algorithms for Clustering Problems (Q6075750) (← links)
- Sparse Semi-Oblivious Routing: Few Random Paths Suffice (Q6202250) (← links)