@Article{Harant2019,
author = "Harant, Jochen and Jendrol', Stanislav",
title = "Lightweight paths in graphs",
journal = "Opuscula Math.",
year = "2019",
volume = "39",
number = "6",
pages = "829--837",
doi = "https://doi.org/10.7494/OpMath.2019.39.6.829",
url = "https://doi.org/10.7494/OpMath.2019.39.6.829",
abstract = "Let \(k\) be a positive integer, \(G\) be a graph on \(V(G)\) containing a path on \(k\) vertices, and \(w\) be a weight function assigning each vertex \(v\in V(G)\) a real weight \(w(v)\). Upper bounds on the weight \(w(P)=\sum_{v\in V(P)}w(v)\) of \(P\) are presented, where \(P\) is chosen among all paths of \(G\) on \(k\) vertices with smallest weight.",
keywords = "weighted graph, lightweight path",
issn = "1232-9274"
}