A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract).
Eyal WeissPublished in: SOCS (2023)
Keyphrases
- shortest path problem
- shortest path
- directed graph
- weighted graph
- single source
- interval data
- undirected graph
- edge detection
- learning environment
- finding the shortest path
- student learning
- total cost
- student model
- directed acyclic graph
- edge information
- multiple objectives
- learning styles
- spanning tree
- graph theory
- combinatorial optimization problems
- edge weights
- search algorithm
- genetic algorithm