Improved approximation algorithms for maximum graph partitioning problems (extended abstract)
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Analysis of algorithms (68W40) Semidefinite programming (90C22) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Improved approximation algorithms for maximum graph partitioning problems
- Improved approximation algorithms for MAX k-CUT and MAX BISECTION
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Approximation algorithms for maximization problems arising in graph partitioning
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Cited in
(10)- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
- An improved rounding method and semidefinite programming relaxation for graph partition
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Approximation algorithms for maximization problems arising in graph partitioning
- Improved linearized models for graph partitioning problem under capacity constraints
- scientific article; zbMATH DE number 910878 (Why is no real title available?)
- Approximation algorithms for semi-random partitioning problems
- Improved approximation algorithms for maximum graph partitioning problems
This page was built for publication: Improved approximation algorithms for maximum graph partitioning problems (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465866)
