An exact combinatorial algorithm for minimum graph bisection
نویسندگان
چکیده
منابع مشابه
An exact combinatorial algorithm for minimum graph bisection
We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equally-sized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully combinatorial. We introduce novel lower bounds based on packing trees, as well as a new decompositi...
متن کاملExact Combinatorial Branch-and-Bound for Graph Bisection
We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equallysized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully combinatorial. We present stronger lower bounds, improved branching rules, and a new decomposition t...
متن کاملAn Ant System Algorithm For Graph Bisection
This paper gives an algorithm for the graph bisection problem using the Ant System (AS) technique. The ant algorithm given in this paper differs from the usual ant algorithms in that the individual ant in the system does not construct a solution to the problem nor a component of the solution directly. Rather the collective behavior of the two species of ants in the system induces a solution to ...
متن کاملAn Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem
The goal of the minimum graph bisection problem is to divide the vertices set of the given undirected graph into two equal-size subsets and such that the number of edges connecting vertices in to vertices in is minimized. In this paper, we propose an efficient method based on genetic algorithm with conditional genetic operators. In the proposed approach, the genetic operators are performed cond...
متن کاملAn Exact Algorithm for Minimum Distortion Embedding
Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5. This is the first algorithm breaking the trivial n!-barrier.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2014
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-014-0811-z