Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: CoRR (2020)
Keyphrases
- optimization problems
- benchmark problems
- graph theory
- related problems
- computational complexity
- computational cost
- practical problems
- learning algorithm
- evolutionary algorithm
- random walk
- run times
- partitioning algorithm
- test problems
- approximate solutions
- graph properties
- problems in computer vision
- partial solutions
- difficult problems
- convergence rate
- search methods
- combinatorial optimization
- data structure