scientific article; zbMATH DE number 1762086
From MaRDI portal
Publication:4537699
zbMATH Open0989.90126MaRDI QIDQ4537699FDOQ4537699
Authors: Eran Halperin, Uri Zwick 
Publication date: 1 July 2002
Title of this publication is not available (Why is that?)
Recommendations
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
- Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Semidefinite programming (90C22) Approximation algorithms (68W25)
Cited In (19)
- Title not available (Why is that?)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints
- An improved kernel for max-bisection above tight lower bound
- Approximation algorithm for MAX DICUT with given sizes of parts
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- On approximation of max-vertex-cover
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Complexity of approximating CSP with balance/hard constraints
- Improved approximation algorithms for MAX \(k\)-CUT and MAX BISECTION
- A .699-approximation algorithm for Max-Bisection.
- Title not available (Why is that?)
- Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
- Better Bounds for Graph Bisection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537699)
