Lower Bounds for the Minimal Sum Coloring Problem.
Aziz MoukrimK. SghiouerCorinne LucetY. LiPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- lower bound
- objective function
- upper bound
- min sum
- np hard
- branch and bound algorithm
- worst case
- lower and upper bounds
- upper and lower bounds
- weighted sum
- branch and bound
- linear programming relaxation
- optimal cost
- randomly generated problems
- square error
- optimal solution
- data sets
- vc dimension
- graph cuts
- special case
- lower bounding
- polynomial approximation