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.