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.

Saved in:

Bibliographic Details
Published in:	2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) pp. 87 - 90
Main Author:	Kel'manov, Alexander
Format:	Conference Proceeding
Language:	English Japanese
Published:	IEEE 01.09.2017
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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