Oblivious network design

DOI10.1145/1109557.1109665zbMath1192.68037OpenAlexW4244823362MaRDI QIDQ3581559

Anupam Gupta, Harald Räcke, Mohammad Taghi Hajiaghayi

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109665

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (20)

Dynamic scheduling in distributed transactional memory ⋮ Load balanced distributed directories ⋮ Covering metric spaces by few trees ⋮ OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty ⋮ On the Complexity of Master Problems ⋮ Universal Algorithms for Clustering Problems ⋮ Randomized oblivious integral routing for minimizing power cost ⋮ Maximum gradient embeddings and monotone clustering ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Bayesian generalized network design ⋮ Algorithms for the universal and a priori TSP ⋮ Optimal nearest neighbor queries in sensor networks ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor ⋮ Distributed transactional memory for general networks ⋮ Unnamed Item ⋮ A priori TSP in the scenario model ⋮ Oblivious Buy-at-Bulk in Planar Graphs ⋮ Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs ⋮ Covering Metric Spaces by Few Trees ⋮ Distributed Distance-Bounded Network Design Through Distributed Convex Programming

This page was built for publication: Oblivious network design