Author:
Dyer Martin,Frieze Alan,Kannan Ravi,Kapoor Ajai,Perkovic Ljubomir,Vazirani Umesh
Abstract
We describe a time randomized algorithm that estimates the number of feasible solutions of a multidimensional knapsack problem within 1 ± ε of the exact number. (Here r is the number of constraints and n is the number of integer variables.) The algorithm uses a Markov chain to generate an almost uniform random solution to the problem.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference15 articles.
1. Approximate counting, uniform generation and rapidly mixing Markov chains
2. How hard is it to marry at random?;Broder;Proceedings of the 18th Annual ACM Symposium on Theory of Computing,1986
3. A mildly exponential approximation algorithm for the permanent
4. On the number of Euler orientations of a graph;Mihail;Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms,1992
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献