{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:34Z","timestamp":1725574114996},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_11","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:28:22Z","timestamp":1294421302000},"page":"69-79","source":"Crossref","is-referenced-by-count":0,"title":["Embracing the Giant Component"],"prefix":"10.1007","author":[{"given":"Abraham","family":"Flaxman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Gamarnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory B.","family":"Sorkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, John Wiley & Sons, New York (2000); With an appendix on the life and work of Paul Erd\u00f6s. MR 2003f:60003","edition":"2"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/rsa.1019","volume":"19","author":"T. Bohman","year":"2001","unstructured":"Bohman, T., Frieze, A.: Avoiding a giant component. Random Structures Algorithms\u00a019(1), 75\u201385 (2001); MR 2002g:05169","journal-title":"Random Structures Algorithms"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bohman, T., Frieze, A., Wormald, N.C.: Avoiding a giant component II (2002) (manuscript)","DOI":"10.1002\/rsa.10018"},{"key":"11_CR4","unstructured":"Bohman, T., Kravitz, D.: Creating a giant component (2003) (manuscript )"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998); MR 2000f:68049","journal-title":"J. ACM"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc.\u00a058, 13\u201330 (1963); MR 26 #1908","journal-title":"J. Amer. Statist. Assoc."},{"key":"11_CR7","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000); MR 2001k:05180"},{"key":"11_CR8","series-title":"London Math. Soc. Lecture Note Ser","first-page":"148","volume-title":"Surveys in combinatorics","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in combinatorics, Norwich. London Math. Soc. Lecture Note Ser, vol.\u00a0141, pp. 148\u2013188. Cambridge Univ. Press, Cambridge (1989); MR 91e:05077"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/rsa.3240010306","volume":"1","author":"B. Pittel","year":"1990","unstructured":"Pittel, B.: On tree census and the giant component in sparse random graphs. Random Structures Algorithms\u00a01(3), 311\u2013342 (1990); MR 92f:05087","journal-title":"Random Structures Algorithms"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 170\u2013178 (2002)","DOI":"10.1145\/509907.509936"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:57:10Z","timestamp":1559915830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}