scientific article; zbMATH DE number 1063797
From MaRDI portal
Publication:4355484
DOI<37::AID-NET5>3.0.CO;2-M 10.1002/(SICI)1097-0037(199708)30:1<37::AID-NET5>3.0.CO;2-MzbMath0887.68003MaRDI QIDQ4355484
Publication date: 25 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES, A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs, Multiple facility location on a network with linear reliability order of edges, Network reliability: Heading out on the highway, A linear time algorithm for computing a most reliable source on a tree network with faulty nodes, The approximability of multiple facility location on directed networks with random arc failures, Network location of a reliable center using the most reliable route policy, On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges, A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges, An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges
