Exact and approximate algorithms for movement problems on (special classes of) graphs

DOI10.1016/j.tcs.2016.09.007zbMath1353.68255MaRDI QIDQ338392

Guido Proietti, Davide Bilò, Luciano Gualà, Stefano Leucci

Publication date: 4 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.007

zbMATH Keywords

graph algorithms; approximation algorithms; motion planning problems; shortest path movement

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68W05: Nonnumerical algorithms

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms