Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH.
Akanksha AgrawalRavi Kiran AllumallaVarun Teja DhanekulaPublished in: IPEC (2021)
Keyphrases
- optimization problems
- learning algorithm
- benchmark problems
- data structure
- difficult problems
- np hard problems
- theoretical analysis
- orders of magnitude
- test problems
- run times
- computationally hard
- exact and approximate
- approximate solutions
- practical problems
- search methods
- times faster
- np complete
- combinatorial optimization
- problems in computer vision
- computational geometry
- theoretical guarantees
- specific problems
- computational problems
- worst case
- greedy algorithms
- significant improvement
- evolutionary algorithm
- objective function