{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:16Z","timestamp":1740123976008,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T00:00:00Z","timestamp":1534291200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10957-018-1354-x","type":"journal-article","created":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T12:03:15Z","timestamp":1534334595000},"page":"1086-1106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Theoretical Complexity of Grid Cover Problems Used in Radar Applications"],"prefix":"10.1007","volume":"179","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4284-3642","authenticated-orcid":false,"given":"Yann","family":"Briheche","sequence":"first","affiliation":[]},{"given":"Frederic","family":"Barbaresco","sequence":"additional","affiliation":[]},{"given":"Fouad","family":"Bennis","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Chablat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"key":"1354_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Symposium on the Complexity of Computer Computations, pp. 85\u2013103. Springer US, Boston, MA (1972). \n                    https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"doi-asserted-by":"publisher","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC, pp. 38\u201349. ACM, New York, NY, USA (1973). \n                    https:\/\/doi.org\/10.1145\/800125.804034","key":"1354_CR2","DOI":"10.1145\/800125.804034"},{"issue":"3","key":"1354_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1354_CR4","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994). \n                    https:\/\/doi.org\/10.1145\/185675.306789","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC, pp. 475\u2013484. ACM, New York, NY, USA (1997). \n                    https:\/\/doi.org\/10.1145\/258533.258641","key":"1354_CR5","DOI":"10.1145\/258533.258641"},{"issue":"1","key":"1354_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.tcs.2006.05.023","volume":"359","author":"B Escoffier","year":"2006","unstructured":"Escoffier, B., Paschos, V.T.: Completeness in approximation classes beyond apx. Theor. Comput. Sci. 359(1), 369\u2013377 (2006). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2006.05.023","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Srinivasan, A.: Improved approximations of packing and covering problems. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, STOC, pp. 268\u2013276. ACM, New York, NY, USA (1995). \n                    https:\/\/doi.org\/10.1145\/225058.225138","key":"1354_CR7","DOI":"10.1145\/225058.225138"},{"issue":"2","key":"1354_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T.: MIPLIB 2010. Math. Progr. Comput. 3(2), 103 (2011). \n                    https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Progr. Comput."},{"key":"1354_CR9","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/1.9781611973075.100","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"G\u00e1bor Pataki","year":"2010","unstructured":"Pataki, G., Tural, M., Wong, E.B.: Basis reduction and the complexity of branch-and-bound. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1254\u20131261. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2010)"},{"key":"1354_CR10","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1007\/978-3-662-47672-7_73","volume-title":"Automata, Languages, and Programming","author":"Jian Li","year":"2015","unstructured":"Li, J., Jin, Y.: A ptas for the weighted unit disk cover problem. In: Automata, Languages, and Programming: 42nd International Colloquium, ICALP, pp. 898\u2013909. Springer, Berlin, Heidelberg (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-47672-7_73"},{"issue":"2","key":"1354_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.comgeo.2012.04.001","volume":"47","author":"TM Chan","year":"2014","unstructured":"Chan, T.M., Grant, E.: Exact algorithms and apx-hardness results for geometric packing and covering problems. Comput. Geom. 47(2), 112\u2013124 (2014). \n                    https:\/\/doi.org\/10.1016\/j.comgeo.2012.04.001\n                    \n                  . (Special Issue: 23rd Canadian Conference on Computational Geometry (CCCG11))","journal-title":"Comput. Geom."},{"key":"1354_CR12","volume-title":"Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network","author":"A Sch\u00f6bel","year":"2006","unstructured":"Sch\u00f6bel, A.: Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network. Springer-Verlag New York, Inc., Secaucus (2006)"},{"issue":"4","key":"1354_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/TAES.1969.309952","volume":"AES\u20135","author":"PM Hahn","year":"1969","unstructured":"Hahn, P.M., Gross, S.D.: Beam shape loss and surveillance optimization for pencil beam arrays. IEEE Trans. Aerosp. Electron. Syst. AES\u20135(4), 674\u2013675 (1969). \n                    https:\/\/doi.org\/10.1109\/TAES.1969.309952","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"doi-asserted-by":"publisher","unstructured":"Torres, S., Adams, R., Curtis, C., Forren, E., Forsyth, D., Ivic, I., Priegnitz, D., Thompson, J., Warde, D.: A demonstration of adaptive weather surveillance and multifunction capabilities on the National Weather Radar Testbed Phased Array Radar. In: Radar Conference (Radar), 2014 International (2014). \n                    https:\/\/doi.org\/10.1109\/RADAR.2014.7060420","key":"1354_CR14","DOI":"10.1109\/RADAR.2014.7060420"},{"doi-asserted-by":"publisher","unstructured":"Briheche, Y., Barbaresco, F., Bennis, F., Chablat, D., Gosselin, F.: Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming. In: 2016 17th International Radar Symposium (IRS) (2016). \n                    https:\/\/doi.org\/10.1109\/IRS.2016.7497343","key":"1354_CR15","DOI":"10.1109\/IRS.2016.7497343"},{"unstructured":"Barbaresco, F., Deltour, J., Desodt, G., Durand, B., Guenais, T., Labreuche, C.: Intelligent M3R radar time resources management: advanced cognition, agility & autonomy capabilities. In: Radar Conference\u2014Surveillance for a Safer World, RADAR. International (2009)","key":"1354_CR16"},{"doi-asserted-by":"publisher","unstructured":"National Research Council: Evaluation of the Multifunction Phased Array Radar Planning Process. The National Academies Press, Washington, D.C. (2008). \n                    https:\/\/doi.org\/10.17226\/12438","key":"1354_CR17","DOI":"10.17226\/12438"},{"key":"1354_CR18","volume-title":"Antenna Theory and Design","author":"W Stutzman","year":"2012","unstructured":"Stutzman, W., Thiele, G.: Antenna Theory and Design. Wiley, Hoboken (2012)"},{"key":"1354_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-075064947-6\/50011-3","volume-title":"Electromagnetic Waves and Antennas","author":"SJ Orfanidis","year":"2016","unstructured":"Orfanidis, S.J.: Electromagnetic Waves and Antennas. Rutgers University, New Brunswick (2016). \n                    https:\/\/doi.org\/10.1016\/B978-075064947-6\/50011-3"},{"key":"1354_CR20","volume-title":"Understanding and Using Linear Programming (Universitext)","author":"J Matouek","year":"2006","unstructured":"Matouek, J., G\u00e4rtner, B.: Understanding and Using Linear Programming (Universitext). Springer-Verlag New York Inc., Secaucus (2006)"},{"issue":"1","key":"1354_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N Megiddo","year":"1991","unstructured":"Megiddo, N.: On finding primal- and dual-optimal bases. ORSA J. Comput. 3(1), 63\u201365 (1991). \n                    https:\/\/doi.org\/10.1287\/ijoc.3.1.63","journal-title":"ORSA J. Comput."},{"key":"1354_CR22","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"1354_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10038","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer-Verlag New York, Inc., Secaucus (2001). \n                    https:\/\/doi.org\/10.1002\/rsa.10038"},{"key":"1354_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)","edition":"1"},{"key":"1354_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 1st edn. Springer-Verlag New York Inc., Secaucus (1999)","edition":"1"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1354-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1354-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1354-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:26:18Z","timestamp":1565810778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1354-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,15]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1354"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1354-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2018,8,15]]},"assertion":[{"value":"31 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}