An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems

2013 ◽  
pp. 304-315 ◽  
Author(s):  
Chenchen Wu ◽  
Donglei Du ◽  
Dachuan Xu
Keyword(s):  
Approximation Algorithm ◽  
Semidefinite Programming ◽  
Graph Bisection

Solving Graph Bisection Problems with Semidefinite Programming

2000 ◽  
Vol 12 (3) ◽  
pp. 177-191 ◽  
Author(s):  
Stefan E. Karisch ◽  
Franz Rendl ◽  
Jens Clausen
Keyword(s):  
Semidefinite Programming ◽  
Graph Bisection

A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM

2009 ◽  
Vol 08 (04) ◽  
pp. 487-498 ◽  
Author(s):  
RONG-LONG WANG ◽  
KOZO OKAZAKI
Keyword(s):  
Genetic Algorithm ◽  
Approximation Algorithm ◽  
Communication Networks ◽  
Ant Colony Algorithm ◽  
Printed Circuit Board ◽  
Ant Colony ◽  
Circuit Board ◽  
Printed Circuit ◽  
Graph Bisection ◽  
Np Complete

The graph bisection problem is an important problem in printed circuit board layout and communication networks. Since it is known to be NP-complete, approximation algorithm have been considered. In this paper, we propose a so-called two-state ant colony algorithm for efficiently solving the problem. In the proposed algorithm two kinds of pheromone and two kinds of heuristic information are introduced to reinforce the search ability. The proposed algorithm is tested on a large number of instances and is compared with a heuristic algorithm and a genetic algorithm. The experimental results show that the proposed approach is superior to its competitors.

Sign in / Sign up

Export Citation Format

Share Document