Corpus ID: 14215750

A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs

@article{Friedland2006APA,
  title={A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs},
  author={S. Friedland and Daniel Levy},
  journal={ArXiv},
  year={2006},
  volume={abs/cs/0607135}
}
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided by a suitable factor. If G is bipartite then one can construct a bipartite Gk. For bipartite graphs this result implies that the number of k-matching has a polynomial-time approximation algorithm. The above results are extended to permanents and hafnians of corresponding matrices. 
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of completeExpand
An analysis of a random algorithm for estimating all the matchings
TLDR
A simple approach (RM) to approximate the permanent, which just yields a critical ratio O($n\omega(n)$) for almost all the 0-1 matrices, provided it's a simple promising practical way to compute this #P-complete problem. Expand
2 4 A ug 2 00 6 Generalized Friedland-Tverberg inequality : applications and extensions
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It isExpand
Generalized Friedland-Tverberg inequality: applications and extensions
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It isExpand
Approximately Counting Perfect and General Matchings in Bipartite and General Graphs
TLDR
Approximately Counting Perfect and General Matchings in Bipartite and General Graphs and finding perfect and general matchings in bipartites and general Graphs is found to be straightforward. Expand
Approximating the Largest Root and Applications to Interlacing Families
TLDR
This work studies the problem of approximating the largest root of a real-rooted polynomial of degree $n using its top $k$ coefficients and gives nearly matching upper and lower bounds and proves corresponding information-theoretic lower bounds of n^{\Omega(1/k)$ and 1+\Omega\left(\frac{2n}{k}}{k}\right)^2. Expand
Analogs of the van der Waerden and Tverberg conjectures for haffnians
We discuss here analogs of van der Waerden and Tverberg permanent conjectures for haffnians on the convex set of matrices whose extreme points are symmetric permutation matrices with zero diagonal.
On the Complexity of Constrained Determinantal Point Processes
TLDR
This paper gives exact efficient algorithms for sampling from constrained DPPs when their description is in unary and proves that when the constraints are specified in binary, this problem is #P-hard via a reduction from the problem of computing mixed discriminants implying that it may be unlikely that there is an FPRAS. Expand

References

SHOWING 1-9 OF 9 REFERENCES
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
TLDR
A polynomial-time randomized algorithm for estimating the permanent of an arbitrary n × n matrix with nonnegative entries computes an approximation that is within arbitrarily small specified relative error of the true value of the permanent. Expand
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non-negative entries.
Generalized Friedland-Tverberg inequality: applications and extensions
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in r-regular bipartite graphs. It isExpand
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
  • A. Barvinok
  • Computer Science
  • Random Struct. Algorithms
  • 1999
We present real, complex, and quaternionic versions of a simple ran-domized polynomial time algorithm to approximate the permanent of a non-negative matrix and, more generally, the mixed discriminantExpand
A proof of a generalized van der Waerden conjecture on permanents
Let A be an n × n matrix. Denote by σ k (A) the sum of all subpermanents of A of order k. Then on the set of doubly stochastic matrices σ k attains its minimum only on the matrix .
The Complexity of Computing the Permanent
  • L. Valiant
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1979
Abstract It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations. RelatedExpand
Concentration of permanent estimators for certain large matrices
Let An = (aij) n=1 be an n n positive matrix with entries in [a;b]; 0 < a b. Let Xn = ( p aijxij) n=1 be a random matrix wherefxijg are i.i.d. N(0; 1) random variables. We show that for large n,Expand
Theory of monomer-dimer systems
We investigate the general monomer-dimer partition function,P(x), which is a polynomial in the monomer activity,x, with coefficients depending on the dimer activities. Our main result is thatP(x) hasExpand
The pressure associated with multidimensional SOFT, in preparation
  • The pressure associated with multidimensional SOFT, in preparation