r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes.
Soh KumabeTakanori MaeharaPublished in: CoRR (2020)
Keyphrases
- optimization problems
- computational problems
- benchmark problems
- np hard problems
- test problems
- computational complexity
- practical problems
- difficult problems
- worst case
- data sets
- combinatorial optimization
- related problems
- problems in computer vision
- approximate solutions
- exact algorithms
- specific problems
- np hardness
- data mining
- theoretical analysis
- computationally efficient
- np complete
- computational cost
- np hard
- data structure
- learning algorithm
- decision problems
- benchmark datasets
- machine learning algorithms
- multi objective
- significant improvement
- theoretical guarantees
- decision trees
- np complete problems
- genetic algorithm