4 papers
Fine-Grained Classification Of Detecting Dominating Patterns
Jonathan Dransfeld, Marvin Künnemann, Mirza Redzic
We consider the following generalization of dominating sets: Let be a host graph and be a pattern graph . A dominating -pattern in is a subset of vertices in…
Resource Constrained Pathfinding with A* and Negative Weights
Saman Ahmadi, Andrea Raith, Mahdi Jalili
Constrained pathfinding is a well-studied, yet challenging network optimisation problem that can be seen in a broad range of real-world applications. Pathfinding with multiple reso…
Parallelizing Multi-objective A* Search
Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith +2
The Multi-objective Shortest Path (MOSP) problem is a classic network optimization problem that aims to find all Pareto-optimal paths between two points in a graph with multiple ed…
Resource Constrained Pathfinding with Enhanced Bidirectional A* Search
Saman Ahmadi, Andrea Raith, Guido Tack +1
The classic Resource Constrained Shortest Path (RCSP) problem aims to find a cost optimal path between a pair of nodes in a network such that the resources used in the path are wit…