The maximum saving partition problem
Authors:
- Refael HassinRHRefael Hassin
- Jérôme MonnotJMJérôme Monnot
Open Access
- 1 May 2005
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 33 (3) , 242-248
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A hypocoloring model for batch schedulingDiscrete Applied Mathematics, 2005
- Weighted Node Coloring: When Stable Sets Are Expensive2002
- z-ApproximationsJournal of Algorithms, 2001
- Bridging gap between standard and differential polynomial approximation: The case of bin-packingApplied Mathematics Letters, 1999
- On Chromatic Sums and Distributed Resource AllocationInformation and Computation, 1998
- Approximating k-set cover and complementary graph coloringLecture Notes in Computer Science, 1996
- Scheduling with incompatible jobsDiscrete Applied Mathematics, 1994
- Maximizing the number of unused colors in the vertex coloring problemInformation Processing Letters, 1994
- Approximation results for the minimum graph coloring problemInformation Processing Letters, 1994
- Chromatic scheduling and frequency assignmentDiscrete Applied Mathematics, 1994