Multicommodity flow approximation used for exact graph partitioning
From MaRDI portal
Recommendations
- Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
- Fast approximation algorithms for multicommodity flow problems
- A polylogarithmic approximation of the minimum bisection
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Approximation algorithms for multicommodity flow and normalized cut problems: Implementations and experimental study
Cited in
(9)- Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Approximation algorithms for multicommodity flow and normalized cut problems: Implementations and experimental study
- Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows
- scientific article; zbMATH DE number 7286677 (Why is no real title available?)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
- ILP-Based Local Search for Graph Partitioning
- Simple probabilistic analysis to generalize bottleneck graph multi-partitioning
- An exact combinatorial algorithm for minimum graph bisection
This page was built for publication: Multicommodity flow approximation used for exact graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897290)