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