A novel algorithm for solution of a combinatory set partitioning problem

被引：0
作者：
V. A. Lyubetsky
A. V. Seliverstov
机构：
[1] Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute),
来源：
Journal of Communications Technology and Electronics | 2016年 / 61卷
关键词：
partitioning algorithm; cubic form; computational complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A novel efficient algorithm for solution of the problem of equal partitioning of a set with predefined weights of elements is proposed. The algorithm is based on calculation of a linear group preserving an invariant: the set of zeros of a cubic form. Algorithms for solution of related problems, including the problem of the search for the second solution if the first solution is known, are discussed.
引用
收藏
页码：705 / 708
页数：3
相关论文
共 50 条
[31]   Complexity and approximation of the connected set-cover problem [J].
Zhang, Wei ;
Wu, Weili ;
Lee, Wonjun ;
Du, Ding-Zhu .
JOURNAL OF GLOBAL OPTIMIZATION, 2012, 53 (03) :563-572
[32]   Complexity and approximation of the connected set-cover problem [J].
Wei Zhang ;
Weili Wu ;
Wonjun Lee ;
Ding-Zhu Du .
Journal of Global Optimization, 2012, 53 :563-572
[33]   A MATHEMATICAL SOLUTION TO A NETWORK DESIGNING PROBLEM [J].
TAKAHASHI, Y .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1995, E78A (10) :1381-1411
[34]   A Multiway Design-driven Partitioning Algorithm for Distributed Verilog Simulation [J].
Li, Lijun ;
Tropper, Carl .
SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 2009, 85 (04) :257-270
[35]   Study and Realization on the Partitioning Algorithm of Parallel Subnet of Petri Net System [J].
Li, Wen-jing ;
Zhang, Xiang-bo ;
Bi, Yingzhou ;
Wang, Xuan .
14TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS FOR BUSINESS, ENGINEERING AND SCIENCE (DCABES 2015), 2015, :58-61
[36]   Fast image matching algorithm based on template partitioning and subtemplate matching [J].
Wu, Zhaoming ;
Deng, Chengzhi ;
Sun, Xiaowei .
International Journal of Wireless and Mobile Computing, 2015, 8 (04) :377-383
[37]   AN ALGORITHM FOR COMPUTING MAXIMUM SOLUTION BASES [J].
HASSIN, R .
OPERATIONS RESEARCH LETTERS, 1990, 9 (05) :315-318
[38]   The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study [J].
Melo, Rafael A. ;
Ribeiro, Celso C. ;
Riveaux, Jose A. .
INFORMATION SCIENCES, 2022, 612 :655-674
[39]   A new min-cut problem with application to electric power network partitioning [J].
Sen, Arunabha ;
Ghosh, Pavel ;
Vittal, Vijay ;
Yang, Bo .
EUROPEAN TRANSACTIONS ON ELECTRICAL POWER, 2009, 19 (06) :778-797
[40]   Generalised distance partitioning for multiple-detection tracking filter based on random finite set [J].
Shen, Xinglin ;
Song, Zhiyong ;
Fan, Hongqi ;
Fu, Qiang .
IET RADAR SONAR AND NAVIGATION, 2018, 12 (02) :260-267
12345