On the 2-MRS problem in a tree with unreliable edges
From MaRDI portal
Publication:1790110
DOI10.1155/2013/743908zbMath1397.68140OpenAlexW2002665837WikidataQ59004207 ScholiaQ59004207MaRDI QIDQ1790110
Wei Ding, Hongfa Wang, Yu Zhou, Guangming Wang, Guangting Chen
Publication date: 10 October 2018
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/743908
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ Weighted cache location problem with identical servers
