A 2-approximation for the maximum satisfying bisection problem
From MaRDI portal
Recommendations
- Approximation of satisfactory bisection problems
- Approximating the minimum bisection size (extended abstract)
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Computing and Combinatorics
Cites work
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- Algorithmic approach to the satisfactory graph partitioning problem
- Approximation of satisfactory bisection problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Satisfactory graph partition, variants, and generalizations
- The satisfactory partition problem
Cited in
(11)- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
- Approximation of satisfactory bisection problems
- Approximating the minimum bisection size (extended abstract)
- scientific article; zbMATH DE number 5734227 (Why is no real title available?)
- A polylogarithmic approximation of the minimum bisection
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality
- An improved kernel for max-bisection above tight lower bound
- scientific article; zbMATH DE number 6500694 (Why is no real title available?)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
This page was built for publication: A 2-approximation for the maximum satisfying bisection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531427)
