An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges

DOI10.1142/S0217595915400102zbMath1311.90029WikidataQ62043098 ScholiaQ62043098MaRDI QIDQ5245845

Guangting Chen, Yu Zhou, Guangming Wang, Wei Ding

Publication date: 15 April 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

quadratic timeedge-turbulence algorithmsum-max 2-MRS

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Connectivity (05C40)

Related Items (1)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
• Network location of a reliable center using the most reliable route policy
• A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
• Continuous data aggregation and capacity in probabilistic wireless sensor networks
• A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES
• Reliability covering problems
• Location of facilities on a network subject to a single‐edge failure
• Facility Location and Reliable Route Planning in Hazardous Material Transportation
• A single facility location problem on a tree with unreliable edges
• Computing a Most Probable Delay Constrained Path: NP-Hardness and Approximation Schemes
• A Reliability Model Applied to Emergency Service Vehicle Location

This page was built for publication: An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges