{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:59:07Z","timestamp":1725483547446},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_23","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"202-210","source":"Crossref","is-referenced-by-count":1,"title":["Exact Sampling in Machine Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Sung-woo","family":"Cho","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0403039","volume":"3","author":"D.J. Aldous","year":"1990","unstructured":"D.J. Aldous. A random walk construction of uniform spanning trees and uniform labelled trees. SI AM Journal on Discrete Mathematics, 3(4):450\u2013465, 1990.","journal-title":"SI AM Journal on Discrete Mathematics"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/137926.137932","volume":"2","author":"S. Asmussen","year":"1992","unstructured":"S. Asmussen, P. Glynn, and H. Thorisson. Stationary detection in the initial transient problem. ACM trans. on modeling and comp. simulation, 2(2):130\u2013157, 1992.","journal-title":"ACM trans. on modeling and comp. simulation"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"A. Broder. Generating random spanning trees. 30th Annual Symposium on Foundations of Computer Science, pages 442\u2013447, 1989.","DOI":"10.1109\/SFCS.1989.63516"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"C. Chekuri, K. Ramanan, P. Whiting, and L. Zhang. Blocking probability estimates in a partitioned sector TDMA system. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial M for Mobility), 2000.","DOI":"10.1145\/345848.345854"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"P. Diaconis and L. Saloff-Coste. What do we know about the metropolis algorithm? Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 112\u2013129, 1995.","DOI":"10.1145\/225058.225095"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1214\/aoap\/1027961037","volume":"8","author":"J. Fill","year":"1998","unstructured":"J. Fill. An interruptible algorithm for perfect sampling via Markov chains. Annals of Applied Probability, 8(1):131\u2013162, 1998.","journal-title":"Annals of Applied Probability"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"D. Hochbaum. Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997.","DOI":"10.1145\/261342.571216"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"M. Huber. Exact sampling and approximate counting techniques. 30th ACM Symposium on the Theory of Computing, pages 31\u201340, 1998.","DOI":"10.1145\/276698.276709"},{"key":"23_CR9","unstructured":"M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. In \u201dApproximation Algorithms for NP-hard Problems,\u201d D.S. Hochbaum ed., 1996."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"L. Lovasz and P. Winkler. Exact mixing in an unknown Markov chain. Electronic Journal of Combinatorics, 2, paper #R15, 1995.","DOI":"10.37236\/1209"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O","volume":"9","author":"J.G. Propp","year":"1996","unstructured":"J.G. Propp and D.B. Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structure & Algorithms, 9:223\u2013252, 1996.","journal-title":"Random Structure & Algorithms"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T17:49:53Z","timestamp":1587491393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}