Complexity and Approximability of the Cover Polynomial
- 98 Downloads
The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, respectively, are two-variate graph polynomials for directed graphs. They count the (weighted) number of ways to cover a graph with disjoint directed cycles and paths, can be thought of as interpolations between determinant and permanent, and are proposed as directed analogues of the Tutte polynomial.
Jaeger, Vertigan, and Welsh showed that the Tutte polynomial is #P-hard to evaluate at all but a few special points and curves. It turns out that the same holds for the cover polynomials: We prove that, in almost the whole plane, the problem of evaluating the cover polynomial and its geometric version is #P-hard under polynomial time Turing reductions, while only three points in the cover polynomial and two points in the geometric cover polynomial are easy. We also study the complexity of approximately evaluating the geometric cover polynomial. Under the reasonable complexity assumptions RP ≠ NP and RFP ≠ #P, we give a succinct characterization of a large class of points at which approximating the geometric cover polynomial within any polynomial factor is not possible.
KeywordsGraph polynomial counting complexity approximation permanent Tutte polynomial
Subject classification68Q17 05C99
Unable to display preview. Download preview PDF.
- Ilia Averbouch , Benny Godlin & Johann A. Makowsky (2008). A Most General Edge Elimination Polynomial. In Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 – July 2, 2008. Revised Papers, volume 5344 of Lecture Notes in Computer Science, 31–42.Google Scholar
- Andreas Björklund, Thore Husfeldt, Petteri Kaski & Mikko Koivisto (2008). Computing the Tutte polynomial in vertex-exponential time.Google Scholar
- Markus Bläser, Holger Dell & Johann A. Makowsky (2008). Complexity of the Bollobás-Riordan Polynomial. In 3rd International Computer Science Symposium in Russia (CSR), 86–98.Google Scholar
- Markus Bläser & Christian Hoffmann (2008). On the Complexity of the Interlace Polynomial. In 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Susanne Albers & Pascal Weil, editors, 97–108. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, Dagstuhl, Germany. http://drops.dagstuhl.de/opus/volltexte/2008/1337
- Markus Bläser & Christian Hoffmann (2009). Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. In Algorithms-ESA 2009, 17th Annual European Symposium, volume 5757 of Lecture Notes in Computer Science, 623–634. Springer.Google Scholar
- Lenore Blum, Felipe Cucker, Michael Shub & Steve Smale (1998). Complexity and real computation. Springer-Verlag New York, Inc., Secaucus, NJ, USA. ISBN 0-387-98281-7.Google Scholar
- Timothy Y. Chow (1996). A Short Proof of the Rook Reciprocity Theorem. Electr. J. Comb. 3(1).Google Scholar
- Martin Dyer, Alan Frieze & Mark Jerrum (2002). On Counting Independent Sets in Sparse Graphs. SICOMP: SIAM Journal on Computing 31.Google Scholar
- Martin E. Dyer, Leslie Ann Goldberg & Mike Paterson (2006). On Counting Homomorphisms to Directed Acyclic Graphs. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, volume 4051 of Lecture Notes in Computer Science, 38–49. Springer.Google Scholar
- Michael R. Garey & David S. Johnson (1979). Computers and Intractability. Freeman, San Francisco.Google Scholar
- Mark Jerrum & Alistair Sinclair (1997). The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration. In Approximation Algorithms for NP-hard Problems, D. Hochbaum, editor. PWS Publishing Company.Google Scholar
- Mark Jerrum, Alistair Sinclair & Eric Vigoda (2004). A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries. JACM: Journal of the ACM 51.Google Scholar
- Christos M. Papadimitriou (1994) Computational Complexity. Addison-Wesley, Reading, MassachusettsGoogle Scholar