Algorithms and Complexity for Path Covers of Temporal DAGs.
Dibyayan ChakrabortyAntoine DaillyFlorent FoucaudRalf KlasingPublished in: MFCS (2024)
Keyphrases
- worst case
- space complexity
- computational complexity
- recently developed
- high computational complexity
- computational cost
- learning algorithm
- data structure
- optimization problems
- orders of magnitude
- computationally complex
- machine learning
- lower complexity
- memory requirements
- significant improvement
- evolutionary algorithm
- combinatorial optimization
- times faster
- temporal reasoning
- spatial and temporal
- reduced complexity
- optimal solution