Minimum Congestion Mapping in a Cloud

DOI10.1137/110845239zbMath1325.68026OpenAlexW1568023593MaRDI QIDQ5258917

Murtaza Zafer, Nikhil 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

zbMATH Keywords

approximation algorithmscloud computinggraph mappingcongestion minimization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Max-Cut Under Graph Constraints ⋮ Approximating graph-constrained max-cut

Cites Work

• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• The quadratic assignment problem. Theory and algorithms
• Graph expansion and the unique games conjecture
• Minimum congestion mapping in a cloud
• On-Line Load Balancing of Temporary Tasks
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• On the Maximum Quadratic Assignment Problem
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• On-Line Load Balancing for Related Machines
• Quorum placement in networks
• Min-max Graph Partitioning and Small Set Expansion
• Expander flows, geometric embeddings and graph partitioning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum Congestion Mapping in a Cloud