{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:47Z","timestamp":1725484607715},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_36","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:43:15Z","timestamp":1179506595000},"page":"428-439","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms for Efficient Filtering in Content-Based Multicast"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Langerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin","family":"Lodha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"36_CR1","unstructured":"Aguilera et al, \u201cMatching Events in a Content-based Subscription System\u201d, http:\/\/www.research.ibm.com\/gryphon"},{"key":"36_CR2","unstructured":"Banavar et al, \u201cAn efficient multicast protocol for content-based publish-subscribe systems\u201d, Technical report, IBM 1998."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Carzaniga et al, \u201cDesign of Scalable Event Notification Service: Interface and Architecture\u201d, Tech Report CU-CS-863-98, University of Colorado, Dept. of Computer Science, 1998.","DOI":"10.21236\/ADA436797"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Kasera et al, \u201cScalable Fair Reliable Multicast Using Active Services\u201d, IEEE Network Magazine, Jan\/Feb 2000.","DOI":"10.1109\/65.819171"},{"key":"36_CR5","unstructured":"F. Anjum and R. Jain, \u201cGeneralized Multicast Using Mobile Filtering Agents\u201d, Internal Report, Telcordia Tech, Morristown, Mar 00."},{"key":"36_CR6","unstructured":"F. Anjum, R. Jain, S. Rajagopalan and R. Shah, \u201cMobile Filters for Efficient Dissemination of Personalized Information Using Content-Based Multicast\u201d, submitted, 2001."},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"A. Tamir, \u201cAn O(pn 2 ) algorithm for the p-median and related problems on tree graphs\u201d, Operations Research Letters, 19:59\u201394, 1996.","journal-title":"Operations Research Letters"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/net.3230220302","volume":"22","author":"A. Tamir","year":"1992","unstructured":"A. Tamir and T. Lowe, \u201cThe generalized p-forest problem on a tree network\u201d, Networks 22, 217\u2013230, 1992.","journal-title":"Networks"},{"key":"36_CR9","first-page":"119","volume-title":"Discrete Location Theory","author":"G. Cornuejols","year":"1990","unstructured":"G. Cornuejols, G.L. Nemhauser and L.A. Wosley, \u201cThe uncapacitated facility location problem\u201d, in P.B. Mirchandani and R.L. Francis(eds), Discrete Location Theory, Wiley, New York, 1990, pp. 119\u2013171."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"M. Brown and R. Tarjan, \u201cA Fast Merging Algorithm\u201d, Journal of ACM, 26(2), pp 211\u2013225, Apr 79.","DOI":"10.1145\/322123.322127"},{"key":"36_CR11","unstructured":"G. Adel\u2019son-Vel\u2019skii and Y. Landis, \u201cAn algorithm for the organization of information\u201d, Dokl. Akad. Nauk SSSR 146, 263\u2013266, (in Russian) English translation in Soviet Math. Dokl., 3-1962, pp1259\u20131262."},{"key":"36_CR12","unstructured":"C. Crane, \u201cLinear lists and priority queues as balanced binary trees\u201d, PhD Thesis, Stanford University, 1972."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:44:04Z","timestamp":1556426644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}