Minimum congestion mapping in a cloud
From MaRDI portal
Publication:5258917
Recommendations
Cites work
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Approximating the minimum quadratic assignment problems
- Expander flows, geometric embeddings and graph partitioning
- Graph expansion and the unique games conjecture
- Min-max Graph Partitioning and Small Set Expansion
- Minimum congestion mapping in a cloud
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On the maximum quadratic assignment problem
- On-Line Load Balancing for Related Machines
- On-Line Load Balancing of Temporary Tasks
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Quorum placement in networks, minimizing network congestion
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The quadratic assignment problem. Theory and algorithms
Cited in
(4)
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)