Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018


Article Details
Title: A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
Article URLs:
Alternative Article URLs:
Authors: Heng Guo
  • University of Edinburgh, School of Informatics
Mark Jerrum
  • Queen Mary, University of London, School of Mathematical Sciences
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icalp/0001J18
Author Comments:

Discuss this paper and its artifacts below