On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier.
Carlo CominRomeo RizziPublished in: TIME (2018)
Keyphrases
- optimization problems
- practical problems
- problems in computer vision
- computational cost
- np complete
- theoretical analysis
- test problems
- highly efficient
- approximate solutions
- computational complexity
- computational problems
- greedy algorithms
- np hard problems
- benchmark problems
- specific problems
- memory efficient
- related problems
- data mining tasks
- computationally hard
- search methods
- machine learning algorithms
- data structure
- learning algorithm
- genetic algorithm
- combinatorial optimization
- difficult problems
- data mining algorithms
- benchmark datasets
- computational geometry
- constraint satisfaction problems
- bayesian networks
- high level