{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:35:41Z","timestamp":1725550541501},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309598"},{"type":"electronic","value":"9783540324287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603771_6","type":"book-chapter","created":{"date-parts":[[2005,12,12]],"date-time":"2005-12-12T17:11:50Z","timestamp":1134407510000},"page":"57-62","source":"Crossref","is-referenced-by-count":2,"title":["Placing a Given Number of Base Stations to Cover a Convex Region"],"prefix":"10.1007","author":[{"given":"Gautam K.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhabani P.","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters\u00a012, 133\u2013137 (1981)","journal-title":"Information Processing Letters"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1004224507766","volume":"34","author":"A. Heppes","year":"1997","unstructured":"Heppes, A., Melissen, J.B.M.: Covering a rectangle with equal circles. Periodica Mathematica Hungarica\u00a034, 65\u201381 (1997)","journal-title":"Periodica Mathematica Hungarica"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"R.Z. Hwang","year":"1993","unstructured":"Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica\u00a09, 1\u201322 (1993)","journal-title":"Algorithmica"},{"key":"6_CR5","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., Nher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00130-4","volume":"99","author":"J.B.M. Melissen","year":"2000","unstructured":"Melissen, J.B.M., Schuur, P.C.: Covering a rectangle with six and seven circles. Discrete Applied Mathematics\u00a099, 149\u2013156 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Melissen, J.B.M., Schuur, P.C.: Improved covering a rectangle with six and seven circles. Electronic J. on Combinatorics\u00a03\u2013R32 (1996)","DOI":"10.37236\/1256"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Nurmela, K.J.: Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Experimental Mathematics\u00a09 (2000)","DOI":"10.1080\/10586458.2000.10504649"},{"key":"6_CR9","unstructured":"Nurmela, K.J., Ostergard, P.R.J.: Covering a square with up to 30 Equal Circles, Research Report HUT-TCS-A62, Laboratory for Theoretical Computer Science, Helsinky University of Technology (2000)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM Journal on Computing\u00a012, 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR11","first-page":"167","volume":"50","author":"T. Tarnai","year":"1995","unstructured":"Tarnai, T., Gasper, Z.: Covering a square by equal circles. Elementary Mathematics\u00a050, 167\u2013170 (1995)","journal-title":"Elementary Mathematics"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1112\/jlms\/s1-24.3.164","volume":"24","author":"S. Verblunsky","year":"1949","unstructured":"Verblunsky, S.: On the least number of unit circles which can cover a square. Journal of the London Mathematical Society\u00a024, 164\u2013170 (1949)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing \u2013 IWDC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603771_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:10Z","timestamp":1619507050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603771_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309598","9783540324287"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11603771_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}