Approximation algorithm for estimating failure probability of multipath transmission

DOI10.1016/J.MATCOM.2011.01.006zbMath1221.68046OpenAlexW2054869715MaRDI QIDQ551469

Sheng Zhong, Yuan Zhang

Publication date: 20 July 2011

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2011.01.006

zbMATH Keywords

approximationerror boundpolynomial complexitycomputer networkmultipath transmission

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Uses Software

• Unnamed Item

Cites Work

• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

This page was built for publication: Approximation algorithm for estimating failure probability of multipath transmission