Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
Luérbio FariaSulamita KleinIgnasi SauRubens SucupiraPublished in: CoRR (2015)
Keyphrases
- max cut
- lower bound
- np hard
- upper bound
- graph model
- planar graphs
- graph partitioning
- spectral graph
- np complete problems
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- min max
- scheduling problem
- optimal solution
- kernel function
- markov random field
- approximation algorithms
- constraint satisfaction problems
- np complete
- evolutionary algorithm