Minimum Congestion Mapping in a Cloud
DOI10.1137/110845239zbMATH Open1325.68026OpenAlexW1568023593MaRDI QIDQ5258917FDOQ5258917
Murtaza Zafer, N. Bansal, Kang-Won Lee, Viswanath Nagarajan
Publication date: 24 June 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/a7f17457-f6b1-45ce-b0c1-083dc3b9dabc
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating the minimum quadratic assignment problems
- The quadratic assignment problem. Theory and algorithms
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Expander flows, geometric embeddings and graph partitioning
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Min-max Graph Partitioning and Small Set Expansion
- Graph expansion and the unique games conjecture
- Minimum congestion mapping in a cloud
- On-Line Load Balancing for Related Machines
- On-Line Load Balancing of Temporary Tasks
- On the Maximum Quadratic Assignment Problem
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
- Quorum placement in networks
Cited In (2)
This page was built for publication: Minimum Congestion Mapping in a Cloud
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5258917)
