scientific article; zbMATH DE number 1063797
From MaRDI portal
Publication:4355484
DOI10.1002/(SICI)1097-0037(199708)30:1%3C37::AID-NET5%3E3.0.CO;2-MzbMATH Open0887.68003MaRDI QIDQ4355484FDOQ4355484
Publication date: 25 May 1998
Title of this publication is not available (Why is that?)
Cited In (13)
- A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
- Network location of a reliable center using the most reliable route policy
- Title not available (Why is that?)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- On the 2-MRS problem in a tree with unreliable edges
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
- 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
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges
- The approximability of multiple facility location on directed networks with random arc failures
- Network reliability: Heading out on the highway
- An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355484)
