The maximum saving partition problem
type: Item
instance of: scholarly article
title: The maximum saving partition problem
zbMATH Open document ID: 1274.90312
author: Refael Hassin
author: Jérôme Monnot
published in: Operations Research Letters
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2173503
zbMATH Keywords: Partitioning
zbMATH Keywords: Color saving
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: j.orl.2004.07.007
OpenAlex ID: W2093134385
cites work: On chromatic sums and distributed resource allocation
cites work: Scheduling with incompatible jobs
cites work: A hypocoloring model for batch scheduling
cites work: Chromatic scheduling and frequency assignment
cites work: Q4414490
cites work: Bridging gap between standard and differential polynomial approximation: The case of bin-packing
cites work: Approximation results for the minimum graph coloring problem
cites work: Q4526990
cites work: \(z\)-approximations
cites work: Maximizing the number of unused colors in the vertex coloring problem
cites work: Approximation Results for the Optimum Cost Chromatic Partition Problem
cites work: Graph colorings with local constraints -- a survey
cites work: Three-quarter approximation for the number of unused colors in graph coloring
DOI: 10.1016/J.ORL.2004.07.007
description: scientific article; zbMATH DE number 2173503