A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
From MaRDI portal
Publication:621840
DOI10.1016/j.tcs.2009.08.003zbMath1207.68035OpenAlexW1996969231WikidataQ62043109 ScholiaQ62043109MaRDI QIDQ621840
Publication date: 28 January 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.003
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (10)
On the Parameterized Complexity of the Expected Coverage Problem ⋮ On the parameterized complexity of the expected coverage problem ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ DIAMETER-CONSTRAINED STEINER TREES ⋮ A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES ⋮ A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) ⋮ The approximability of multiple facility location on directed networks with random arc failures ⋮ Minimum diameter cost-constrained Steiner trees ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges
Cites Work
- Unnamed Item
- Unnamed Item
- A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
- Reliability covering problems
- Location of facilities on a network subject to a single‐edge failure
- A single facility location problem on a tree with unreliable edges
- A Reliability Model Applied to Emergency Service Vehicle Location
- Locating A Broadcast Facility In An Unreliable Network
This page was built for publication: A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
