Polynomial algorithms to finite Veber problem for a tree network
From MaRDI portal
Publication:1176800
DOI10.1016/0377-0427(91)90215-6zbMath0746.05034MaRDI QIDQ1176800
Boris V. Pelzwerger, A. V. Panyukov
Publication date: 25 June 1992
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(91)90215-6
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
94C15: Applications of graph theory to circuits and networks
Related Items
Unnamed Item, Algorithm for the discrete Weber's problem with an accuracy estimate, Solving a maximin location problem on the plane with given accuracy, On the existence of an integer solution to the relaxed Weber problem for a tree network
Uses Software
Cites Work