{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:04:18Z","timestamp":1725732258833},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/wcnc.2005.1424791","type":"proceedings-article","created":{"date-parts":[[2005,4,25]],"date-time":"2005-04-25T18:49:51Z","timestamp":1114454991000},"page":"1836-1841 Vol. 3","source":"Crossref","is-referenced-by-count":1,"title":["Towards optimal sensor placement with hypercube cutting planes"],"prefix":"10.1109","author":[{"given":"S.","family":"Chaudhuri","sequence":"first","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.K.","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264137"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2005.1424791"},{"key":"10","article-title":"A tight analysis of the greedy algorithm for set cover","author":"slavi?k","year":"1995","journal-title":"Technical Report"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/24\/4\/010"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"6","article-title":"Arrangements","author":"halperin","year":"1997","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/800031.808601"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"4"},{"journal-title":"Art Gallery Theorems and Algorithms","year":"1987","author":"o'rourke","key":"9"},{"journal-title":"Perceptions","year":"1969","author":"minsky","key":"8"}],"event":{"name":"2005 IEEE Wireless Communications and Networking Conference","start":{"date-parts":[[2005,3,13]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2005,3,17]]}},"container-title":["IEEE Wireless Communications and Networking Conference, 2005"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9744\/30730\/01424791.pdf?arnumber=1424791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T18:46:58Z","timestamp":1709923618000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1424791\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/wcnc.2005.1424791","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}