Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence

Alexander Kel'Manov

doi:10.1109/SIBIRCON.2017.8109843

Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence

Alexander Kel'Manov

Кафедра теоретической кибернетики ММФ

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › рецензирование

Аннотация

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.

Язык оригинала	английский
Название основной публикации	Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
Издатель	Institute of Electrical and Electronics Engineers Inc.
Страницы	87-90
Число страниц	4
ISBN (электронное издание)	9781538615966
DOI	https://doi.org/10.1109/SIBIRCON.2017.8109843
Состояние	Опубликовано - 14 ноя 2017
Событие	2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 - Novosibirsk, Российская Федерация Продолжительность: 18 сен 2017 → 22 сен 2017

Конференция

Конференция	2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017
Страна	Российская Федерация
Город	Novosibirsk
Период	18.09.2017 → 22.09.2017

Доступ к документу

10.1109/SIBIRCON.2017.8109843

Другие файлы и ссылки

Link to publication in Scopus

Fingerprint

Подробные сведения о темах исследования «Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@inproceedings{a77c127b494446b6a2fc4b609529cd57,

title = "Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence",

abstract = "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.",

keywords = "Data analysis, Efficient algorithms with performance guarantees, NP-hardness, Partitioning",

author = "Alexander Kel'Manov",

year = "2017",

month = nov,

day = "14",

doi = "10.1109/SIBIRCON.2017.8109843",

language = "English",

pages = "87--90",

booktitle = "Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017 ; Conference date: 18-09-2017 Through 22-09-2017",

}

Kel'Manov, A 2017, Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence. в Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017., 8109843, Institute of Electrical and Electronics Engineers Inc., стр. 87-90, 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017, Novosibirsk, Российская Федерация, 18.09.2017. https://doi.org/10.1109/SIBIRCON.2017.8109843

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. стр. 87-90 8109843.

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › рецензирование

TY - GEN

T1 - Efficient approximation algorithms for some NP-hard problems of partitioning a set and a sequence

AU - Kel'Manov, Alexander

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 -