Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor

Random Structures and Algorithms

Volumn 14, Issue 1, 1999, Pages 29-61

  Barvinok, Alexander ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Approximation algorithms; Mixed discriminant; Permanent; Randomized algorithms

Indexed keywords

EID: 0033479677     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(1999010)14:1<29::AID-RSA2>3.0.CO;2-X     Document Type: Article

References (29)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A.D. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes, Mat Sb (NS) 3 (1938), 227-251 (in Russian).
3. E. Artin, Geometric Algebra, Wiley-Interscience, New York, 1988.
4. R.G. Bartle, The Elements of Integration, John Wiley & Sons, New York, 1966.
5. A.I. Barvinok, Two algorithmic results for the traveling salesman problem, Math Oper Res 21 (1996), 65-84.
6. A.I. Barvinok, Computing mixed discriminants, mixed volumes, and permanents, Discrete Comput Geom 18 (1997), 205-207.
7. A.I. Barvinok, A simple polynomial time algorithm to approximate the permanent within a simply exponential factor, MSRI, No. 1997-031, preprint.
8. M. Dyer and M. Jerrum, Schloss Dagstuhl Meeting on Approximation Algorithms, August 1998, personal communication.
9. G.P. Egorychev, The solution of van der Waerden's problem for permanents, Adv in Math 42 (1981), 299-305.
10. V.A. Emelichev, M.M. Kovalev, and M.K. Kravtsov, Polytopes, Graphs and Optimization, Cambridge University Press, New York, 1984.
11. V.N. Faddeeva, Computational Methods of Linear Algebra, Dover, New York, 1975.
12. A. Frieze and M. Jerrum, An analysis of a Monte Carlo algorithm for estimating the permanent, Combinatorica 15 (1995), 67-83.
13. C.D. Godsil and I. Gutman, On the matching polynomial of a graph, in Algebraic Methods in Graph Theory, Vol. I, II, (Szeged, 1978), North-Holland, Amsterdam-New York, 1981, pp. 241-249.
14. D.Yu. Grigoriev and M. Karpinski, The matching problem for bipartite graphs with polynomially bounded permanents as in NC, Proc 28th Annual IEEE Symp on Foundations of Computer Science, IEEE Computer Soc Press Washington D.C., 1987, pp. 162-172.
15. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J Comput 18 (1989), 1149-1178.
16. M. Jerrum and A. Sinclar, The Markov chain Monte Carlo method: An approach to approximate counting and integration, in Approximation Algorithms for NP-hard Problems, D.S. Hochbaum, (Editor), PWS, Boston, MA, 1996, pp. 482-520.
17. M.R. Jerrum, L.G. Valiant, and V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret Comp Sci 43 (1986), 169-188.
18. M. Jerrum and U. Vazirani, A mildly exponential approximation algorithm for the permanent, Algorithmica 16 (1996), 392-401.
19. N. Karmarkar, R. Karp, R. Lipton, L. Lovász, and M. Luby, A. Monte Carlo algorithm for estimating the permanent, SIAM J Comput 22 (1993), 284-293.
20. D.E. Knuth, The Art of Computer Programming. Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981, 2nd ed.
21. K. Leichtweiss, Convexity and differential geometry, in Handbook of Convex Geometry, P.M. Gruber and J.M. Wills, (Editors), North-Holland, Amsterdam, 1993, Vol. B, Chap. 4.1, pp. 1045-1080.
22. N. Linial, A. Samorodnitsky, and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, preprint.
23. L. Lovász and M.D. Plummer, Matching Theory, North-Holland, Amsterdam-New York and Akad. Kiadó, Budapest, 1986.
24. L. Lovász and M. Simonovits, Random walks in a convex body and an improved volume algorithm, Random Structures Algorithms, 4 (1993), 359-412.
25. H. Minc, Permanents, Addison-Wesley, Reading, MA, 1978.
26. V.V. Prasolov, Problems and Theorems in Linear Algebra, Am Math Soc, Providence, RI, 1994.
27. L.E. Rasmussen, Approximating the permanent: A simple approach, Random Structures Algorithms, 5 (1994), 349-361.
28. R.P. Stanley, Two combinatorial applications of the Alexandrov-Fenchel inequalities, J Combin Theory Ser A, 17 (1981), 56-65.
29. N. White, Unimodular matroids, in Combinatorial Geometries, Cambridge University Press, Cambridge, U.K., 1987, pp. 40-52.