View Item 

Show simple item record

Approximate counting via random optimization

dc.contributor.authorBarvinok, Alexander I.en_US
dc.date.accessioned2006-04-19T14:10:04Z
dc.date.available2006-04-19T14:10:04Z
dc.date.issued1997-09en_US
dc.identifier.citationBarvinok, Alexander (1997)."Approximate counting via random optimization." Random Structures and Algorithms 11(2): 187-198. <http://hdl.handle.net/2027.42/35109>en_US
dc.identifier.issn1042-9832en_US
dc.identifier.issn1098-2418en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/35109
dc.description.abstractLet ℱ n be a family of subsets of {1,…, n }. We propose a simple randomized algorithm to estimate the cardinality of ℱ n from the maximum weight of a subset X ∈ℱ n in a random weighting of {1,…, n }. The examples include enumeration of perfect matchings in graphs, bases in matroids, and Hamiltonian cycles in graphs. © 1997 John Wiley & Sons, Inc.  Random Struct. Alg. , 11 , 187–198 (1997)en_US
dc.format.extent176461 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherJohn Wiley & Sons, Inc.en_US
dc.subject.otherMathematics and Statisticsen_US
dc.titleApproximate counting via random optimizationen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, MI 48109-1109 ; Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1109en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/35109/1/6_ftp.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1002/(SICI)1098-2418(199709)11:2<187::AID-RSA6>3.0.CO;2-Oen_US
dc.identifier.sourceRandom Structures and Algorithmsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
6_ftp.pdf
Size:
172.3KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.