Oblivious network design
From MaRDI portal
Cited in
(27)- Optimal nearest neighbor queries in sensor networks
- Adaptive-adversary-robust algorithms via small copy tree embeddings
- Covering Metric Spaces by Few Trees
- Oblivious buy-at-bulk in planar graphs
- Algorithms for the universal and a priori TSP
- Scattering and sparse partitions, and their applications
- Bayesian generalized network design
- Load balanced distributed directories
- On \(r\)-to-\(p\) norms of random matrices with nonnegative entries: asymptotic normality and \(\ell_{\infty}\)-bounds for the maximizer
- On the complexity of master problems
- Universal algorithms for clustering problems
- Distributed transactional memory for general networks
- Universal Algorithms for Clustering Problems
- Scattering and sparse partitions, and their applications
- An improved upper bound for the universal TSP on the grid
- Randomized oblivious integral routing for minimizing power cost
- Maximum gradient embeddings and monotone clustering
- Covering metric spaces by few trees
- Sparse Semi-Oblivious Routing: Few Random Paths Suffice
- A priori TSP in the scenario model
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Optimal padded decomposition for bounded treewidth graphs
- Dynamic scheduling in distributed transactional memory
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- Optimal lower bounds for universal and differentially private Steiner trees and TSPs
- Bayesian generalized network design
- Distributed distance-bounded network design through distributed convex programming
This page was built for publication: Oblivious network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581559)
