{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T05:10:35Z","timestamp":1686460235697},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T00:00:00Z","timestamp":1321401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00453-011-9591-5","type":"journal-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T12:28:11Z","timestamp":1321446491000},"page":"295-310","source":"Crossref","is-referenced-by-count":1,"title":["Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,16]]},"reference":[{"issue":"7","key":"9591_CR1","doi-asserted-by":"crossref","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B. Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size \u03b5-nets for axis-parallel rectangles and boxes. SIAM J. Comput. 39(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"key":"9591_CR2","first-page":"48","volume-title":"Proc. ACM MOBICOM","author":"L. Bao","year":"2002","unstructured":"Bao, L., Garcia-Luna-Aceves, J.: Transmission scheduling in ad hoc networks with directional antennas. In: Proc. ACM MOBICOM, pp. 48\u201358 (2002)"},{"key":"9591_CR3","first-page":"171","volume-title":"Proc. Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"P. Berman","year":"2007","unstructured":"Berman, P., Kasiviswanathan, S.P., Urgaonkar, B.: Packing to angles and sectors. In: Proc. Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 171\u2013180 (2007)"},{"key":"9591_CR4","unstructured":"Berman, P., Karpinski, M.: Improved approximation lower bounds on small occurrence optimization. Electron. Colloq. Computat. Complex. 10(008) (2003)"},{"key":"9591_CR5","first-page":"45","volume-title":"Proc. Canadian Conference on Computational Geometry (CCCG)","author":"B. Broden","year":"2001","unstructured":"Broden, B., Hammar, M., Nilsson, B.J.: Guarding lines and 2-link polygons is APX-hard. In: Proc. Canadian Conference on Computational Geometry (CCCG), pp. 45\u201348 (2001)"},{"issue":"4","key":"9591_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9591_CR7","first-page":"135","volume-title":"Proc. Annual ACM Symposium on Computational Geometry 2005","author":"K.L. Clarkson","year":"2005","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for vertex cover. In: Proc. Annual ACM Symposium on Computational Geometry 2005, pp. 135\u2013141 (2005)"},{"key":"9591_CR8","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"E.G. Coffman","year":"1997","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, pp. 46\u201393. PWS Publishing, Boston (1997)"},{"key":"9591_CR9","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"9591_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Yao, A.C.: Resource constrained scheduling as generalized bin-packing. J. Comb. Theory, Ser. A 21, 257\u2013298 (1976), cited from E.G. Coffman, M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing: a survey. In: D.S. Hochbaum (ed.) Approximation Algorithms for NP-hard Problems, p.\u00a050","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9591_CR11","volume-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"2003","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman, New York (2003)"},{"issue":"1","key":"9591_CR12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing in image processing and VLSI. J. ACM 32(1), 130\u2013136 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"9591_CR13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"9591_CR14","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0022-0000(03)00006-0","volume":"66","author":"H. Kellerer","year":"2003","unstructured":"Kellerer, H., Pferschy, U., Speranza, M.: An efficient approximation scheme for the subset sum problem. J. Comput. Syst. Sci. 66(2), 349\u2013370 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9591_CR15","unstructured":"Patrascu, M.: Personal communication, August 2009"},{"key":"9591_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/778415.778426","volume-title":"Proc. ACM MobiHoc 2003","author":"C. Peraki","year":"2003","unstructured":"Peraki, C., Servetto, S.: On the maximum stable throughput problem in random networks with directional antennas. In: Proc. ACM MobiHoc 2003, pp. 76\u201387 (2003)"},{"key":"9591_CR17","volume-title":"Proc. IEEE INFOCOM","author":"A. Spyropoulos","year":"2002","unstructured":"Spyropoulos, A., Raghavendra, C.S.: Energy efficient communication in ad hoc networks using directional antennas. In: Proc. IEEE INFOCOM (2002)"},{"key":"9591_CR18","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/778415.778429","volume-title":"Proc. ACM MobiHoc","author":"S. Yi","year":"2003","unstructured":"Yi, S., Pei, Y., Kalyanaraman, S.: On the capacity improvement of ad hoc wireless networks using directional antennas. In: Proc. ACM MobiHoc, vol. 2003, pp. 108\u2013116 (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9591-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9591-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9591-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T04:42:11Z","timestamp":1686458531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9591-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,16]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9591"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9591-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,16]]}}}