{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:40Z","timestamp":1725574120574},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_28","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:32:30Z","timestamp":1294439550000},"page":"329-340","source":"Crossref","is-referenced-by-count":0,"title":["A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding"],"prefix":"10.1007","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Kenyon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S0097539798347906","volume":"30","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Guha, S., Naor, J(S.), Schieber, B.: Multicasting in Heterogeneous Networks. SIAM J. Comput.\u00a030(2), 347\u2013358 (2000)","journal-title":"SIAM J. Comput."},{"key":"28_CR2","unstructured":"Elkin, M., Kortsarz, G.: Sublogarithmic Approximation for Telephone Multicast: Path out of Jungle. In: SODA (2003) ( to appear)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01840353","volume":"2","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Leighton, F.T., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica\u00a02, 113\u2013129 (1987)","journal-title":"Algorithmica"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/S0097539700379760","volume":"31","author":"F.T. Leighton","year":"2001","unstructured":"Leighton, F.T., Lu, C.-J., Rao, S.B., Srinivasan, A.: New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. SIAM Journal on Computing\u00a031, 626\u2013641 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"28_CR6","unstructured":"Ravi, R.: Rapid Rumor Ramification: Approximation the minimum broadcast time. In: 35th IEEE Symposium on Foundations of Computer Science, FOCS (1994)"},{"key":"28_CR7","unstructured":"Srinivasan, A.: An Extension of the Lovasz Local Lemma and its Applications to Integer Programming. In: Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 6\u201315 (1996)"}],"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\/978-3-540-45198-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T11:15:49Z","timestamp":1553339749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}