{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:16Z","timestamp":1751282836097},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1109\/icme.2001.1237903","type":"proceedings-article","created":{"date-parts":[[2005,8,25]],"date-time":"2005-08-25T08:25:34Z","timestamp":1124958334000},"page":"1041-1044","source":"Crossref","is-referenced-by-count":1,"title":["On-line selection of distinguishing elements for focused information retrieval"],"prefix":"10.1109","author":[{"given":"K.","family":"Chen","sequence":"first","affiliation":[]},{"given":"W.","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"H.","family":"Chim","sequence":"additional","affiliation":[]},{"given":"X.","family":"Deng","sequence":"additional","affiliation":[]},{"given":"H.","family":"Feng","sequence":"additional","affiliation":[]},{"given":"S.","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372093"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00047-5"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372094"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267824"},{"key":"2","first-page":"268","article-title":"Improved approximation guarantees for packing and covering programs","author":"srinivasan","year":"1995","journal-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing"},{"journal-title":"Linear Programming Relaxations Approximation Algorithms and Randomization A Unified View of Covering Problems","year":"1994","author":"bertsimas","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00054-7"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"5","article-title":"An extension of the Lov sz local lemma, and its application to integer programming","author":"srinivasan","year":"1996","journal-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"journal-title":"Approximation Algorithms for NP-Hard Problems","year":"1997","author":"dorit","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/64.577468"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301376"}],"event":{"name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001","start":{"date-parts":[[2001,8,22]]},"location":"Tokyo, Japan","end":{"date-parts":[[2001,8,25]]}},"container-title":["IEEE International Conference on Multimedia and Expo, 2001. ICME 2001."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8766\/27769\/01237903.pdf?arnumber=1237903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:11:02Z","timestamp":1489425062000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1237903\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icme.2001.1237903","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}