Abstract
We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor. We also give a combinatorial application of the lower bound, proving S. Friedland's 'Asymptotic Lower Matching Conjecture'for the monomer-dimer problem.
Original language | English |
---|---|
Title of host publication | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
Publisher | IEEE Computer Society |
Pages | 90-99 |
Number of pages | 10 |
ISBN (Electronic) | 9781479965175 |
DOIs | |
State | Published - 7 Dec 2014 |
Event | 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 - Philadelphia, United States Duration: 18 Oct 2014 → 21 Oct 2014 |
Publication series
Name | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |
---|---|
ISSN (Print) | 0272-5428 |
Conference
Conference | 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 |
---|---|
Country/Territory | United States |
City | Philadelphia |
Period | 18/10/14 → 21/10/14 |
Bibliographical note
Publisher Copyright:© 2014 IEEE.
Keywords
- approximation of the permanent
- bounds on the permanent