A Fixed-Parameter Perspective on #BIS

The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class # RH Π 1 . It is believed that #BIS does not have an efficient approximation algorithm but also that it is not...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 10; pp. 3844 - 3864
Main Authors:	Curticapean, Radu, Dell, Holger, Fomin, Fedor, Goldberg, Leslie Ann, Lapinskas, John
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2019 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Approximation Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematical analysis Mathematics of Computing Parameterization Parameters Polynomials Special Issue: Parameterized and Exact Computation Theory of Computation Parameterised complexity Independent sets Approximate counting
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!