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

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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) S. 87 - 90
1. Verfasser:	Kel'manov, Alexander
Format:	Tagungsbericht
Sprache:	Englisch Japanisch
Veröffentlicht:	IEEE 01.09.2017
Schlagworte:	Algorithm design and analysis Approximation algorithms Clustering algorithms Data analysis efficient algorithms with performance guarantees NP-hard problem NP-hardness partitioning Partitioning algorithms Time complexity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
DOI:	10.1109/SIBIRCON.2017.8109843