{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:10Z","timestamp":1725558970062},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_54","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"641-652","source":"Crossref","is-referenced-by-count":12,"title":["Streaming Algorithms for Independent Sets"],"prefix":"10.1007","author":[{"given":"Bjarni V.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Losievskaja","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-02930-1_27","volume-title":"Automata, Languages and Programming","author":"K.J. Ahn","year":"2009","unstructured":"Ahn, K.J., Guha, S.: Graph Sparsification in the Semi-streaming Model. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 328\u2013338. Springer, Heidelberg (2009)"},{"key":"54_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-48413-4_3","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"N. Alon","year":"1999","unstructured":"Alon, N., Arad, U., Azar, Y.: Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 16\u201327. Springer, Heidelberg (1999)"},{"issue":"1","key":"54_CR3","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Computer and System Sciences\u00a058(1), 1167\u20131181 (1999)","journal-title":"J. Computer and System Sciences"},{"key":"54_CR4","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method. John Wiley and Sons, Chichester (1992)"},{"key":"54_CR5","unstructured":"Bar-Yossed, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA, pp. 623\u2013632 (2002)"},{"key":"54_CR6","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Streaming graph computations with a helpful advisor. arXiv:1004.2899v1"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Finocchi, I., Ribichini, A.: Trading off space for passes in graph streaming problems. In: SODA, pp. 714\u2013723 (2006)","DOI":"10.1145\/1109557.1109635"},{"key":"54_CR8","unstructured":"Emek, Y., Halld\u00f3rsson, M.M., Mansour, Y., Patt-Shamir, B., Rawitz, D.: Online set packing. To appear in PODC (2010)"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. In: STACS (2010)","DOI":"10.1137\/100801901"},{"issue":"2","key":"54_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On Graph Problems in a Semi-Streaming Model. Theoretical Computer Science\u00a0348(2), 207\u2013216 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"54_CR11","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070683155","volume":"38","author":"J. Feigenbaum","year":"2008","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput.\u00a038(5), 1709\u20131727 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"54_CR12","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0304-3975(01)00411-X","volume":"289","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Taketomi, S.: Online independent sets. Theoretical Computer Science\u00a0289(2), 953\u2013962 (2002)","journal-title":"Theoretical Computer Science"},{"key":"54_CR13","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications (2003) (manuscript), \n                    \n                      http:\/\/athos.rutgers.edu\/~muthu\/stream-1-1.ps"},{"issue":"3","key":"54_CR14","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/S0895480102419731","volume":"18","author":"H. Shachnai","year":"2005","unstructured":"Shachnai, H., Srinivasan, A.: Finding Large Independent Sets of Hypergraphs in Parallel. SIAM J. Discrete Math.\u00a018(3), 488\u2013500 (2005)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:40:02Z","timestamp":1558280402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}