r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes.
Soh KumabeTakanori MaeharaPublished in: WALCOM (2021)
Keyphrases
- optimization problems
- np complete
- computational problems
- hard problems
- computational complexity
- related problems
- combinatorial optimization
- data structure
- worst case
- test problems
- search methods
- fixed parameter tractable
- run times
- iterative algorithms
- difficult problems
- benchmark problems
- orders of magnitude
- theoretical analysis
- computational cost
- data sets
- learning theory
- constraint satisfaction problems
- computationally efficient
- approximate solutions
- problems in computer vision
- exact algorithms
- evolutionary algorithm
- decision trees
- computationally hard
- np hard problems
- feature selection
- machine learning