Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence. / Kel'Manov, Alexander.
Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 87-90 8109843.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence
AU - Kel'Manov, Alexander
N1 - Publisher Copyright: © 2017 IEEE.
PY - 2017/11/14
Y1 - 2017/11/14
N2 - We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.
AB - We consider some poorly studied NP-hard partitioning problems. The paper purpose is to present a short survey on some new results on efficient algorithms with performance guarantees for their solutions.
KW - Data analysis
KW - Efficient algorithms with performance guarantees
KW - NP-hardness
KW - Partitioning
UR - http://www.scopus.com/inward/record.url?scp=85040512935&partnerID=8YFLogxK
U2 - 10.1109/SIBIRCON.2017.8109843
DO - 10.1109/SIBIRCON.2017.8109843
M3 - Conference contribution
AN - SCOPUS:85040512935
SP - 87
EP - 90
BT - Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
Y2 - 18 September 2017 through 22 September 2017
ER -
ID: 9115160