FPT Algorithms for Plane Completion Problems.
Dimitris ChatzidimitriouArchontia C. GiannopoulouSpyridon ManiatisClément RequiléDimitrios M. ThilikosDimitris ZorosPublished in: MFCS (2016)
Keyphrases
- optimization problems
- benchmark problems
- orders of magnitude
- learning algorithm
- difficult problems
- practical problems
- computational complexity
- run times
- computationally efficient
- evolutionary algorithm
- approximate solutions
- significant improvement
- np hard problems
- times faster
- search methods
- test problems
- computational problems
- three dimensional
- greedy algorithms
- computational geometry
- fixed parameter tractable
- hard problems
- inference problems
- multi class
- iterative algorithms
- exact algorithms
- partial solutions
- data sets
- related problems
- combinatorial optimization
- data mining algorithms
- np complete
- worst case