A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability.

Heng Guo Mark Jerrum

Published in: ICALP (2018)

Keyphrases

polynomial time approximation
computational complexity
np hard
theoretical analysis
objective function
bin packing
dynamic programming
worst case
linear programming
search space
shortest path
monte carlo
error bounds
special case
combinatorial optimization
greedy algorithm
optimal solution
real time