A Survey of Approximation Algorithms for the Permanent

Michael Luby
Additional contact information
Michael Luby: University of Toronto, Department of Computer Science

A chapter in Sequences, 1990, pp 75-91 from Springer

Abstract: Abstract In this paper we give a survey of recent work on the problem of approximating the permanent.

Keywords: Markov Chain; Approximation Algorithm; Bipartite Graph; Perfect Matchings; Regular Graph (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().