{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:29:32Z","timestamp":1749184172417,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/ispan.2004.1300466","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"104-109","source":"Crossref","is-referenced-by-count":11,"title":["Approximation algorithms design for disk partial covering problem"],"prefix":"10.1109","author":[{"family":"Bin Xiao","sequence":"first","affiliation":[]},{"family":"Jiannong Cao","sequence":"additional","affiliation":[]},{"family":"Qingfeng Zhuge","sequence":"additional","affiliation":[]},{"family":"Yi He","sequence":"additional","affiliation":[]},{"given":"E.H.-M.","family":"Sha","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/570810.570818"},{"article-title":"A geometric theorem for approximate disk covering algorithms","year":"2001","author":"franceschetti","key":"ref11"},{"key":"ref12","first-page":"642","article-title":"Algorithms for facility location problems with outliers","author":"charikar","year":"2001","journal-title":"Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-48224-5_19","article-title":"Approximation algorithms for partial covering problems","author":"gandhi","year":"2001","journal-title":"Proceedings of the Twenty-Eighth International Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref4","first-page":"741","article-title":"The p-center problem: heuristic and optimal algorithms","volume":"35","author":"drezner","year":"1984","journal-title":"J Oper Res Soc"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","article-title":"Almost optimal set covers in finite vcdimension","volume":"14","author":"bronninamm","year":"1995","journal-title":"Discrete Computational Geometry"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185335"},{"key":"ref8","first-page":"658","article-title":"Exact and approximation algorithms for clustering (extended abstract)","author":"agarwal","year":"1998","journal-title":"Proc 9th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62255"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"ref1","first-page":"538","article-title":"Approximation algorithms for projective clustering","author":"agarwal","year":"2000","journal-title":"Proc of ACM-SIAM Symp Discrete Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90075-S"}],"event":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","start":{"date-parts":[[2004,5,12]]},"location":"Hong Kong, China","end":{"date-parts":[[2004,5,12]]}},"container-title":["7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9103\/28881\/01300466.pdf?arnumber=1300466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T11:38:00Z","timestamp":1585827480000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1300466\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ispan.2004.1300466","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}