On local search for the generalized graph coloring problem,

T. Vredeveld*, J.K. Lenstra

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review


    Given an edge-weighted graph and an integer k, the generalized graph coloring problem is the problem of partitioning the vertex set into k subsets so as to minimize the total weight of the edges that are included in a single subset. We recall a result on the equivalence between karush–kuhn–tucker points for a quadratic programming formulation and local optima for the simple flip-neighborhood. We also show that the quality of local optima with respect to a large class of neighborhoods may be arbitrarily bad and that some local optima may be hard to find.
    Original languageEnglish
    Pages (from-to)28-34
    JournalOperations Research Letters
    Publication statusPublished - 1 Jan 2003

    Cite this