The maximum saving partition problem

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Operations Research Letters

• Publication date

  2005-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.orl.2004.07.007
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A hypocoloring model for batch scheduling

  2005cited by this paper
• Weighted Node Coloring: When Stable Sets Are Expensive

  2002cited by this paper
• z-Approximations

  2001cited by this paper
• Three-Quarter Approximation for the Number of Unused Colors in Graph Coloring

  1999influential reference
• Bridging gap between standard and differential polynomial approximation: The case of bin-packing

  1999cited by this paper
• On Chromatic Sums and Distributed Resource Allocation

  1998cited by this paper
• Graph colorings with local constraints - a survey

  1997cited by this paper
• Approximation results for the optimum cost chromatic partition problem

  1997cited by this paper
• Approximation of k-set cover by semi-local optimization

  1997cited by this paper
• Chromatic Scheduling and Frequency Assignment

  1994cited by this paper
• Maximizing the Number of Unused Colors in the Vertex Coloring Problem

  1994cited by this paper
• Approximation Results for the Minimum Graph Coloring Problem

  1994cited by this paper
• Scheduling with Incompatible Jobs

  1992cited by this paper
• Approximating K-set Cover and Complementary Graph Coloring

  year unknowncited by this paper

• Applications and Extensions

  2021cites this paper
• Differential approximations for min set cover

  2018cites this paper
• Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results

  2016cites this paper
• A Unified Framework for Integer Programming Formulation of Graph Matching Problems

  2015cites this paper
• A survey on the structure of approximation classes

  2010cites this paper
• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

  2009cites this paper
• New differential approximation algorithm for k-customer vehicle routing problem

  2009influential citation
• A better differential approximation ratio for symmetric TSP

  2008cites this paper
• Structures des classes d'approximation : un état de l'art

  2007cites this paper
• Complexity and approximation results for the Min Weighted Coloring problem

  2007cites this paper
• Laboratoire D'analyse Et Modélisation De Systèmes Pour L'aide À La Décision Cahier Du Lamsade 267 a Survey on the Structure of Approximation Classes a Survey on the Structure of Approximation Classes

  2007cites this paper
• Approximation polynomiale de problèmes d’optimisation : aspects structurels et opérationnels

  2005cites this paper
• On the differential approximation of MIN SET COVER

  2005cites this paper
• Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation

  2004cites this paper
• Laboratoire D'analyse Et Modélisation De Systèmes Pour L'aide À La Décision Cahier Du Lamsade 261 Better Differential Approximation for Symmetric Tsp Better Differential Approximation for Symmetric Tsp

  year unknowncites this paper
• CAHIER DU LAMSADE 267

  year unknowncites this paper