On the Complexity of Solving or Approximating Convex Recoloring Problems.
Manoel B. CampêloCristiana G. HuibanRudini M. SampaioYoshiko WakabayashiPublished in: COCOON (2013)
Keyphrases
- convex programming
- solving problems
- combinatorial optimization
- convex optimization problems
- solving complex
- decision problems
- problems involving
- computational complexity
- convex programs
- np hardness
- convex optimization
- np complete
- optimization problems
- np hard
- genetic algorithm
- space complexity
- piecewise linear
- convex functions
- semidefinite
- worst case
- denoising
- polynomial hierarchy
- combinatorial optimisation
- multicommodity flow problems