Better Approximations for the Minimum Common Integer Partition Problem

2006 ◽  
pp. 248-259 ◽  
Author(s):  
David P. Woodruff
Keyword(s):  
Partition Problem ◽  
Integer Partition

scholarly journals A network flow approach to the Minimum Common Integer Partition Problem

2006 ◽  
Vol 369 (1-3) ◽  
pp. 456-462 ◽  
Author(s):  
Wenbo Zhao ◽  
Peng Zhang ◽  
Tao Jiang
Keyword(s):  
Network Flow ◽  
Partition Problem ◽  
Integer Partition

scholarly journals On the Minimum Common Integer Partition Problem

2006 ◽  
pp. 236-247 ◽  
Author(s):  
Xin Chen ◽  
Lan Liu ◽  
Zheng Liu ◽  
Tao Jiang
Keyword(s):  
Partition Problem ◽  
Integer Partition

scholarly journals On the minimum common integer partition problem

2008 ◽  
Vol 5 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Xin Chen ◽  
Lan Liu ◽  
Zheng Liu ◽  
Tao Jiang
Keyword(s):  
Partition Problem ◽  
Integer Partition

Randomized greedy multi-start algorithm for the minimum common integer partition problem

2016 ◽  
Vol 50 ◽  
pp. 226-235 ◽  
Author(s):  
Manuel Lozano ◽  
Francisco J. Rodriguez ◽  
Daniel Peralta ◽  
Carlos García-Martínez
Keyword(s):  
Partition Problem ◽  
Integer Partition

The d-Subtree Partition Problem

2010 ◽  
Vol 33 (4) ◽  
pp. 652-665
Author(s):  
Yan-Guang CAI ◽  
Yun ZHANG ◽  
Ji-Xin QIAN
Keyword(s):  
Partition Problem

scholarly journals A new multi-level algorithm for balanced partition problem on large scale directed graphs

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Xianyue Li ◽  
Yufei Pang ◽  
Chenxia Zhao ◽  
Yang Liu ◽  
Qingzhen Dong
Keyword(s):  
Large Scale ◽  
Directed Graphs ◽  
Vlsi Design ◽  
Graph Partition ◽  
Partition Problem ◽  
Multi Level ◽  
The Stability ◽  
Recursive Partition ◽  
Balanced Partition ◽  
Partition Method

AbstractGraph partition is a classical combinatorial optimization and graph theory problem, and it has a lot of applications, such as scientific computing, VLSI design and clustering etc. In this paper, we study the partition problem on large scale directed graphs under a new objective function, a new instance of graph partition problem. We firstly propose the modeling of this problem, then design an algorithm based on multi-level strategy and recursive partition method, and finally do a lot of simulation experiments. The experimental results verify the stability of our algorithm and show that our algorithm has the same good performance as METIS. In addition, our algorithm is better than METIS on unbalanced ratio.

Sign in / Sign up

Export Citation Format

Share Document