Hardness of approximation for shortest path with vector costs

DOI10.1137/1.9781611978971.143MaRDI QIDQ7294671zbMATH OpenFDO

Authors Yury Makarychev, Ron Mosenzon

Publication date 13 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978971.143

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Hardness of approximation for shortest path with vector costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294671)