Finding optimal paths in MREP routing

DOI10.1016/j.ipl.2003.10.005zbMath1178.68678MaRDI QIDQ1029048

J. Blot

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.10.005

zbMATH Keywords

computational complexity; graph algorithms; approximation algorithms

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms