Oblivious network design

DOI10.1145/1109557.1109665zbMath1192.68037MaRDI 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

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

Unnamed Item, Covering Metric Spaces by Few Trees, Optimal nearest neighbor queries in sensor networks, Universal Algorithms for Clustering Problems, OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty, Randomized oblivious integral routing for minimizing power cost, Algorithms for the universal and a priori TSP, 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