{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:23:47Z","timestamp":1725495827129},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_28","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T14:45:01Z","timestamp":1195915501000},"page":"269-278","source":"Crossref","is-referenced-by-count":4,"title":["Station Layouts in the Presence of Location Constraints"],"prefix":"10.1007","author":[{"given":"Christos","family":"Kaklamanis","sequence":"first","affiliation":[]},{"given":"Lefteris M.","family":"Kirousis","sequence":"additional","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"28_CR1","unstructured":"L. I. Aupperle, H. E. Conn, J. M. Kell, and J. O\u2019Rourke, \u201cCovering Orthogonal Polygons with Squares\u201d, in proceedings of 26th Annual Allerton Conference on Coom. Contr, and Comp., Urbana, 28\u201330, Sep. 1988."},{"key":"28_CR2","unstructured":"R. Bar-Yehuda, and E. Ben-Chanoch, \u201cAn O(N log_ N) Time Algorithm for Covering Simple Polygons with Squares\u201d, in proceedings of the 2nd Canadian Conference on Computational Geometry, held in Ottawa, pp. 186\u2013190, 1990."},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. N. Clark","year":"1990","unstructured":"B. N. Clark, C. J. Colbourn, and D. S. Johnson, \u201cUnit Disk Graphs\u201d, Discrete Mathematics 86(1990) 165\u2013177.","journal-title":"Unit Disk Graphs\u201d, Discrete Mathematics"},{"key":"28_CR4","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, \u201cAn Introduction to Algorithms\u201d, MIT Press, 1990."},{"key":"28_CR5","unstructured":"N. A. DePano, Y. Ko, and J. O\u2019Rourke, \u201cFinding Largest Equilateral Triangles and Squares\u201d, Proceedings of the Allerton Conference, pages 869\u2013878, 1987."},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril, \u201cAlgorithms for Minimum Coloring, Minimum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph\u201d, SIAM J. Comput., Vol. 1, No. 2, June 1972, pp. 180\u2013187.","journal-title":"SIAM J. Comput"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. S. Hochbaum","year":"1985","unstructured":"D. S. Hochbaum and W. Maass, \u201cApproximation Schemes for Covering and Packing Problems in Image Processing and VLSI\u201d, J. ACM 32:130\u2013138, 1985.","journal-title":"J. ACM"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"H. B. Hunt, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns, \u201cNC Approximation Schemes for NP-and PSPACE-Hard Problems for Geometric Graphs\u201d, in Proceedings of 2nd ESA, pp. 468\u2013477.","DOI":"10.1006\/jagm.1997.0903"},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1023\/A:1019198426770","volume":"3","author":"J. C. Lin","year":"1997","unstructured":"J. C, Lin, \u201cBiological Aspects of Mobile Communication Data\u201d, Wireless Networks, pages 439\u2013453, Vol. 3 (1997) No, 6.","journal-title":"Wireless Networks"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"D. Moitra, \u201cFinding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm\u201d, Algorithmica (1991) 6: 624\u2013657.","DOI":"10.1007\/BF01759065"},{"key":"28_CR11","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"K. Pahlavan and A. Levesque, \u201cWireless Information Networks,\u201d Wiley-Interscience, New York, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T17:02:33Z","timestamp":1551114153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}