FPTAS for Counting Weighted Edge Covers

DOI10.1007/978-3-662-44777-2_54zbMath1425.68457OpenAlexW326868420MaRDI QIDQ2921451

Chihao Zhang, Jing-Cheng Liu, Pinyan Lu

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_54

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (6)

Zeros and approximations of holant polynomials on the complex plane ⋮ On the connection between interval size functions and path counting ⋮ Absence of zeros implies strong spatial mixing ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ On the Complexity of Holant Problems ⋮ Some applications of Wagner's weighted subgraph counting polynomial

This page was built for publication: FPTAS for Counting Weighted Edge Covers