Approximation results for the minimum graph coloring problem
Information Processing Letters
Chromatic scheduling and frequency assignment
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Maximizing the number of unused colors in the vertex coloring problem
Information Processing Letters
Scheduling with incompatible jobs
Discrete Applied Mathematics
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On chromatic sums and distributed resource allocation
Information and Computation
Approximation results for the optimum cost chromatic partition problem
Journal of Algorithms
Journal of Algorithms
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
Three-quarter approximation for the number of unused colors in graph coloring
Information Sciences: an International Journal
On the differential approximation of MIN SET COVER
Theoretical Computer Science
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
New differential approximation algorithm for k-customer vehicle routing problem
Information Processing Letters
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
The input to the MAXIMUM SAVING PARTITION PROBLEM consists of a set V={1,...,n}, weights w"i, a function f, and a family S of feasible subsets of V. The output is a partition (S"1,...,S"l) such that S"i@?S, and @?"j"@?"Vw"j-@?"i"="1^lf(S"i) is maximized. We present a general 12-approximation algorithm, and improved algorithms for special cases of the function f.