The maximum labeled path problem

DOI10.1007/s00453-016-0155-6zbMath1360.68901MaRDI QIDQ527429

Yann Vaxès, Basile Couëtoux, Elie Nakache

Publication date: 11 May 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-016-0155-6

zbMATH Keywords

graph algorithm; approximation algorithm; hardness of approximation; labels

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

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

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms