{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:17:51Z","timestamp":1725560271693},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_3","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:00:06Z","timestamp":1127829606000},"page":"19-31","source":"Crossref","is-referenced-by-count":1,"title":["Path Coupling Using Stopping Times"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Bordewich","sequence":"first","affiliation":[]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Bordewich, M., Dyer, M., Karpinski, M.: Path coupling using stopping times and counting independent sets and colourings in hypergraphs (2005), http:\/\/arxiv.org\/abs\/math.PR\/0501081"},{"key":"3_CR2","unstructured":"Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurrence optimization. Electronic Colloquium on Computational Complexity\u00a010 (2003), Technical Report TR03-008"},{"key":"3_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0695-1","volume-title":"Randomized algorithms: approximation, generation and counting","author":"R. Bubley","year":"2001","unstructured":"Bubley, R.: Randomized algorithms: approximation, generation and counting. Springer, London (2001)"},{"key":"3_CR4","first-page":"248","volume-title":"Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997)","author":"R. Bubley","year":"1997","unstructured":"Bubley, R., Dyer, M.: Graph orientations with no sink and an approximation for a hard case of #SAT. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 248\u2013257. SIAM, Philadelphia (1997)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35th ACM Symposium on Theory of Computing (STOC 2003), pp. 595\u2013601. ACM, New York (2003)","DOI":"10.1145\/780542.780629"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/SFCS.2002.1181880","volume-title":"Proc. 43rd Symposium on Foundations of Computer Science (FOCS 2002)","author":"I. Dinur","year":"2002","unstructured":"Dinur, I., Regev, O., Smyth, C.: The hardness of 3-uniform hypergraph coloring. In: Proc. 43rd Symposium on Foundations of Computer Science (FOCS 2002), pp. 33\u201342. IEEE, Los Alamitos (2002)"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/FOCS.2004.57","volume-title":"Proc. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004)","author":"M. Dyer","year":"2004","unstructured":"Dyer, M., Frieze, A., Hayes, T., Vigoda, E.: Randomly coloring constant degree graphs. In: Proc. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 582\u2013589. IEEE, Los Alamitos (2004)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/S0097539701383844","volume":"31","author":"M. Dyer","year":"2002","unstructured":"Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. SIAM Journal on Computing\u00a031, 1527\u20131541 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1137\/S0097539700372708","volume":"30","author":"M. Dyer","year":"2001","unstructured":"Dyer, M., Goldberg, L., Greenhill, C., Jerrum, M., Mitzenmacher, M.: An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM Journal on Computing\u00a030, 1962\u20131975 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/jagm.1999.1071","volume":"35","author":"M. Dyer","year":"2000","unstructured":"Dyer, M., Greenhill, C.: On Markov chains for independent sets. Journal of Algorithms\u00a035, 17\u201349 (2000)","journal-title":"Journal of Algorithms"},{"key":"3_CR11","volume-title":"Computer and intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computer and intractability. W. H. Freeman and Company, New York (1979)"},{"key":"3_CR12","first-page":"103","volume-title":"Proc. 15th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2004)","author":"T. Hayes","year":"2004","unstructured":"Hayes, T., Vigoda, E.: Variable length path coupling. In: Proc. 15th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2004), pp. 103\u2013110. SIAM, Philadelphia (2004)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/BFb0055806","volume-title":"Mathematical Foundations of Computer Science 1998","author":"T. Hofmeister","year":"1998","unstructured":"Hofmeister, T., Lefmann, H.: Approximating maximum independent sets in uniform hypergraphs. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 562\u2013570. Springer, Heidelberg (1998)"},{"key":"3_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random graphs. Wiley-Interscience, New York (2000)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M. Jerrum","year":"1995","unstructured":"Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structure and Algorithms\u00a07, 157\u2013165 (1995)","journal-title":"Random Structure and Algorithms"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Counting, sampling and integrating: algorithms and complexity. ETH Z\u00fcrich Lectures in Mathematics, Birkh\u00e4user, Basel (2003)","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"3_CR17","first-page":"327","volume-title":"Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001)","author":"M. Krivelevich","year":"2001","unstructured":"Krivelevich, M., Nathaniel, R., Sudakov, B.: Approximating coloring and maximum independent sets in 3-uniform hypergraphs. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 327\u2013328. SIAM, Philadelphia (2001)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<229::AID-RSA3>3.0.CO;2-X","volume":"15","author":"M. Luby","year":"1999","unstructured":"Luby, M., Vigoda, E.: Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures and Algorithms\u00a015, 229\u2013241 (1999)","journal-title":"Random Structures and Algorithms"},{"key":"3_CR19","unstructured":"Mitzenmacher, M., Niklova, E.: Path coupling as a branching process, unpublished manuscript (2002)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/1098-2418(200103)18:2<101::AID-RSA1000>3.0.CO;2-D","volume":"18","author":"M. Molloy","year":"2001","unstructured":"Molloy, M.: Very rapidly mixing Markov chains for 2\u0394-coloring and for independent sets in a graph with maximum degree 4. Random Structures and Algorithms\u00a018, 101\u2013115 (2001)","journal-title":"Random Structures and Algorithms"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02199113","volume":"86","author":"J. Salas","year":"1997","unstructured":"Salas, J., Sokal, A.: Absence of phase transition for anti-ferromagnetic Potts models via the Dobrushin uniqueness theorem. Journal of Statistical Physics\u00a086, 551\u2013579 (1997)","journal-title":"Journal of Statistical Physics"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Vigoda, E.: A note on the Glauber dynamics for sampling independent sets.The Electronic Journal of Combinatorics 8, R8(1) (2001)","DOI":"10.37236\/1552"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:23Z","timestamp":1605643943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11537311_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}