# Approximability of the Minimum Bisection Problem: An Algorithmic Challenge

@inproceedings{Karpinski2002ApproximabilityOT,
title={Approximability of the Minimum Bisection Problem: An Algorithmic Challenge},
author={Marek Karpinski},
booktitle={MFCS},
year={2002}
}
• M. Karpinski
• Published in MFCS 26 August 2002
• Computer Science, Mathematics
We survey some recent results on the complexity of computing approximate solutions for instances of the Minimum Bisection problem and formulate some very intriguing and still open questions about the approximability status of that problem.
23 Citations
Minimum bisection is NP-hard on unit disk graphs
• Computer Science
Inf. Comput.
• 2017
Optimal cuts and partitions in tree metrics in polynomial time
• Computer Science, Mathematics
Inf. Process. Lett.
• 2013
Approximation schemes for Metric Bisection and partitioning
• Computer Science
SODA '04
• 2004
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of distances across the
A strong inapproximability gap for a generalization of minimum bisection
• Mathematics
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
• 2003
It is proved that it is NP-hard to determine distinguish between the cases that all but a fraction of the equations can be satisfied and that at least a fraction 1/4-/spl epsi/ of all equations cannot be satisfied.
Studies in Efficient Discrete Algorithms
The result resolves, in particular, the complexity status of the optimal partition problems in one-dimensional geometric (Euclidean) setting and derives several hardness results on the detection of monomials with such properties within exact, parametrized and approximation complexity.
Two new integer linear programming formulations for the vertex bisection problem
• Mathematics, Computer Science
Comput. Optim. Appl.
• 2019
Two new integer linear programming (ILP) formulations for VBP are proposed and the experimental results clearly indicate that these formulations outperform ILPLIT in average objective value, average computing time and number of optimal solutions found.
Graph Partitions:Recent Progresses and Some Open Problems
This paper presents some results and problems on graph partitions, of which most are from the topic originated from the maximum k-partite subgraph problem.
A spectral heuristic for bisecting random graphs
The spectral heuristic solves instances in the subcritical, the critical, and the supercritical phases of the phase transition optimally with probability 1 − o(1) with results that extend previous work of Boppana Proc.
Approximation Complexity of Max-Cut on Power Law Graphs
• Computer Science, Mathematics
ArXiv
• 2016
This paper shows that there exist polynomial time approximation schemes for MAX-CUT on PLGs for the power law exponent $\beta$ in the interval $(0,2)$, and gives an approximation algorithm with improved constant approximation ratio for the case of $\beta>2$.

## References

SHOWING 1-10 OF 39 REFERENCES
Approximating Bounded Degree Instances of NP-Hard Problems
The best up to now known explicit nonapproximability bounds on the very small degree optimization problems which are of particular importance on the intermediate stages of proving approximation hardness of some other generic optimization problems are presented.
A note on approximating Max-Bisection on regular graphs
• Mathematics, Computer Science
Inf. Process. Lett.
• 2000
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
Some inherent limits for the existence of polynomial time approximation schemes for some dense instances of NP-hard combinatorial optimization problems are indicated and other approximation problems can be solved by using dense techniques.
Polynomial time approximation of dense weighted instances of MAX-CUT
• Computer Science, Mathematics
Random Struct. Algorithms
• 1998
We give the rst polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight
On Some Tighter Inapproximability Results
• Computer Science, Mathematics
Electron. Colloquium Comput. Complex.
• 1998
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurrence satisfiability problems like MAX-2SAT and E2-LIN-2, and
On Some Tighter Inapproximability Results (Extended Abstract)
• Computer Science, Mathematics
ICALP
• 1999
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurence satisfiability problems like MAX-2SAT and E2-LIN-2, and
Finding a Maximum Cut of a Planar Graph in Polynomial Time
The problem of finding a maximum cut of an arbitrary graph is one of a list of 21 combinatorial problems (Karp–Cook list). It is unknown whether or not there exist algorithms operating in polynomia...
Approximating the minimum bisection size (extended abstract)
• Computer Science, Mathematics
STOC '00
• 2000
This work presents an algorithm that finds a bisection that is within O(v/-nlogn) of optimal, and no sublinear approximation ratio for bisection was previously known.
The Minimum Satisfiability Problem