Faster algorithms for vertex partitioning problems parameterized by clique-width.
Sang-il OumSigve Hortemo SætherMartin VatshellePublished in: Theor. Comput. Sci. (2014)
Keyphrases
- optimization problems
- combinatorial optimization
- computational problems
- theoretical guarantees
- difficult problems
- greedy algorithms
- problems in computer vision
- learning algorithm
- np hard problems
- related problems
- benchmark problems
- test problems
- memory efficient
- computational complexity
- convex optimization problems
- partitioning algorithm
- run times
- approximate solutions
- computational geometry
- partial solutions
- orders of magnitude
- decision trees