Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time.
Filippo BrunelliLaurent ViennotPublished in: CoRR (2022)
Keyphrases
- minimum cost
- capacity constraints
- np hard
- network flow
- approximation algorithms
- spanning tree
- linear relaxation
- network flow problem
- worst case
- network simplex algorithm
- linear constraints
- temporal information
- temporal reasoning
- minimum cost flow
- global constraints
- constraint programming
- constraint satisfaction
- semi supervised
- special case
- search space