paper-with-me

홈 › Papers

Recent Progress on Graph Partitioning Problems Using Evolutionary Computation

2018-05-04 · Hye-Jin Kim, Yong-Hyuk Kim

The graph partitioning problem (GPP) is a representative combinatorial optimization problem which is NP-hard. Currently, various approaches to solve GPP have been introduced. Among these, the GPP solution using evolutionary computation (EC) is an effective approach. There has not been any survey on the research applying EC to GPP since 2011. In this survey, we introduce various attempts to apply EC to GPP made in the recent seven years.

📄 PDF Abstract BibTeX arXiv:1805.01623

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial Optimizationgraph partitioningSurvey

Similar Papers 제목 키워드 기반

Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening

2018-03-25 · Richard J. Preen, Jim Smith

Hypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems. Current tec…

Evolutionary Algorithmshypergraph partitioning

Distributed Evolutionary Graph Partitioning

2011-10-03 · Peter Sanders, Christian Schulz

We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa pro…

graph partitioning

Evolutionary Acyclic Graph Partitioning

2017-09-25 · Orlando Moreira, Merten Popp, Christian Schulz

Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the problem of parallelizing computation for mult…

graph partitioningScheduling

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

2020-08-09 · Markus Friedrich, Sebastian Feld, Thomy Phan, Pierre-Alain Fayolle

Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design. Solutions based on algorithmic geometry impose constraints on usable model …

Combinatorial Optimizationgraph partitioning

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization

2020-06-30 · Benjamin Doerr, Frank Neumann

The theory of evolutionary computation for discrete search spaces has made significant progress in the last ten years. This survey summarizes some of the most important recent results in this research area. It discusses …

Combinatorial OptimizationEvolutionary Algorithms