Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Vorozhtsov, Mikhail"'
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark graphs and
Externí odkaz:
http://arxiv.org/abs/1708.00774
Publikováno v:
Yugoslav Journal of Operations Research, Vol 29, Iss 1, Pp 93-112 (2019)
The paper presents a comparison between three approaches to solving the length-bounded maximum multicommodity flow problem with unit edge-lengths. Following the first approach, Garg and Könemann’s, we developed an improved fully polynomial time ap
Externí odkaz:
https://doaj.org/article/988de7f13dea4c62b46e753b32a587e1
