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 条
[41]   A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number [J].
Sukegawa, Noriyoshi ;
Miyauchi, Atsushi .
DISCRETE OPTIMIZATION, 2013, 10 (04) :331-332
[42]   New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts [J].
Smith, Logan A. ;
Hicks, Illya V. .
NETWORKS, 2022, 79 (02) :202-219
[43]   On the All-Farthest-Segments problem for a planar set of points [J].
Mukhopadhyay, Asish ;
Chatterjee, Samidh ;
Lafreniere, Benjamin .
INFORMATION PROCESSING LETTERS, 2006, 100 (03) :120-123
[44]   A complexity dichotomy and a new boundary class for the dominating set problem [J].
D. S. Malyshev .
Journal of Combinatorial Optimization, 2016, 32 :226-243
[45]   A complexity dichotomy and a new boundary class for the dominating set problem [J].
Malyshev, D. S. .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) :226-243
[46]   On a Countable Family of Boundary Graph Classes for the Dominating Set Problem [J].
Dakhno G.S. ;
Malyshev D.S. .
Journal of Applied and Industrial Mathematics, 2023, 17 (01) :25-31
[47]   A finite set of functions with an EXPTIME-complete composition problem [J].
Kozik, Marcin .
THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) :330-341
[48]   A Data Gathering Scheme for WSN/WSAN Based on Partitioning Algorithm and Mobile Sinks [J].
Zhang, Xiangli ;
Bao, Hanrong ;
Yan, Kun ;
Zhang, Hongmei ;
Ye, Jin .
2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), 2013, :1968-1973
[49]   Research on Petri Net System Parallel Subnet Partitioning Completeness Theory and Algorithm [J].
LI Wenjing ;
LI Songzhao ;
LU Jianbo .
Wuhan University Journal of Natural Sciences, 2019, 24 (03) :205-217
[50]   Voltage equalization of an ultracapacitor module by cell grouping using number partitioning algorithm [J].
Oyarbide, E. ;
Bernal, C. ;
Molina, P. ;
Jimenez, L. A. ;
Galvez, R. ;
Martinez, A. .
JOURNAL OF POWER SOURCES, 2016, 301 :113-121