A spanning tree-based encoding of the MAX CUT problem for evolutionary search

Authors:
Kisung Seo;Soohwan Hyun;Yong-Hyuk Kim
Affiliations:
Dept. of Electronic Engineering, Seokyeong University, Seoul, Korea;Dept. of Electronic Engineering, Seokyeong University, Seoul, Korea;Dept. of Computer Science and Engineering, Kwangwoon University, Seoul, Korea
Venue:
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Year:
2012

Citing 24
Cited 0

Optimal layer assignment for interconnect

Advances in VLSI and Computer Systems
An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants

IEEE Transactions on Computers
A linear time algorithm for graph partition problems

Information Processing Letters
Finding good approximate vertex and edge partitions is NP-hard

Information Processing Letters
A fuzzy clustering algorithm for graph bisection

Information Processing Letters
Expected complexity of graph partitioning problems

Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Design and performance of parallel and distributed approximation algorithms for Maxcut

Journal of Parallel and Distributed Computing
On the Quality of Spectral Separators

SIAM Journal on Matrix Analysis and Applications
P-Complete Approximation Problems

Journal of the ACM (JACM)
A note on approximating Max-Bisection on regular graphs

Information Processing Letters
Genetic Algorithm and Graph Partitioning

IEEE Transactions on Computers
Unstructured Grapg Partitioning for Sparse Linear System Solving

IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
A Combinatorial Design Approach to MAXCUT

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Lock-Gain Based Graph Partitioning

Journal of Heuristics
Linear transformation in Pseudo-Boolean functions

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Representation and recombination over nonsingular binary matrices

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Problem-independent schema synthesis for genetic algorithms

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A Note on Edge-based Graph Partitioning and its Linear Algebraic Structure

Journal of Mathematical Modelling and Algorithms
Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Multiway VLSI circuit partitioning based on dual net representation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
New spectral methods for ratio cut partitioning and clustering

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of previous genetic algorithms for solving graph problems have used vertex-based encoding. In this paper, we introduce spanning tree-based encoding instead of vertex-based encoding for the well-known MAX CUT problem. We propose a new genetic algorithm based on this new type of encoding. We conducted experiments on benchmark graphs and could obtain performance improvement on sparse graphs, which appear in real-world applications such as social networks and systems biology, when the proposed methods are compared with ones using vertex-based encoding.