On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier.
Carlo CominRomeo RizziPublished in: CoRR (2018)
Keyphrases
- optimization problems
- combinatorial optimization
- graph theory
- search methods
- data structure
- np hard problems
- times faster
- practical problems
- approximate solutions
- problems in computer vision
- significant improvement
- hard problems
- learning algorithm
- memory efficient
- greedy algorithms
- heuristic methods
- benchmark problems
- np complete
- computational cost
- highly efficient
- test problems
- neural network
- related problems
- orders of magnitude
- difficult problems
- machine learning algorithms
- constraint satisfaction problems
- theoretical guarantees
- specific problems
- reinforcement learning
- machine learning