{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:00Z","timestamp":1740109380370,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T00:00:00Z","timestamp":1711324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T00:00:00Z","timestamp":1711324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312186\/2020-7","425340\/2016-3"],"award-info":[{"award-number":["312186\/2020-7","425340\/2016-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2020\/13162-2","2015\/11937-9"],"award-info":[{"award-number":["2020\/13162-2","2015\/11937-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00224-024-10170-2","type":"journal-article","created":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T10:02:21Z","timestamp":1711360941000},"page":"571-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the MAXSPACE Advertisement Problem"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1001-082X","authenticated-orcid":false,"given":"Lehilton L. C.","family":"Pedrosa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0691-4554","authenticated-orcid":false,"given":"Mauro R. C.","family":"da Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0472-4810","authenticated-orcid":false,"given":"Rafael C. S.","family":"Schouery","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,25]]},"reference":[{"issue":"2","key":"10170_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/jos.74","volume":"5","author":"M Adler","year":"2002","unstructured":"Adler, M., Gibbons, P.B., Matias, Y.: Scheduling space-sharing for internet advertising. J. Sched. 5(2), 103\u2013119 (2002). https:\/\/doi.org\/10.1002\/jos.74","journal-title":"J. Sched."},{"issue":"2","key":"10170_CR2","first-page":"33","volume":"37","author":"R Briggs","year":"1997","unstructured":"Briggs, R., Hollis, N.: Advertising on the web: Is there response before click-through? J. Advert. Res. 37(2), 33\u201346 (1997)","journal-title":"J. Advert. Res."},{"issue":"3","key":"10170_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/s0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005). https:\/\/doi.org\/10.1137\/s0097539700382820","journal-title":"SIAM J. Comput."},{"key":"10170_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.entcs.2019.08.061","volume":"346","author":"MR Da Silva","year":"2019","unstructured":"Da Silva, M.R., Schouery, R.C., Pedrosa, L.L.: A polynomial-time approximation scheme for the maxspace advertisement problem. Electronic Notes in Theoretical Computer Science. 346, 699\u2013710 (2019)","journal-title":"Electronic Notes in Theoretical Computer Science."},{"issue":"4","key":"10170_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/A:1024060710627","volume":"6","author":"M Dawande","year":"2003","unstructured":"Dawande, M., Kumar, S., Sriskandarajah, C.: Performance bounds of algorithms for scheduling advertisements on a web page. J. Sched. 6(4), 373\u2013394 (2003)","journal-title":"J. Sched."},{"key":"10170_CR6","doi-asserted-by":"crossref","unstructured":"Dean, B.C., Goemans, M.X.: Improved approximation algorithms for minimum-space advertisement scheduling. In: In Proceedings of International Colloquium on Automata, Languages, and Programming, pp 1138\u20131152 (2003)","DOI":"10.1007\/3-540-45061-0_87"},{"key":"10170_CR7","doi-asserted-by":"crossref","unstructured":"Freund, A,, Naor, J.S.: Approximating the advertisement placement problem. In: Proceedings of International Conference on Integer Programming and Combinatorial Optimization, pp 415\u2013424 (2002)","DOI":"10.1007\/3-540-47867-1_29"},{"issue":"1","key":"10170_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","volume":"15","author":"AM Frieze","year":"1984","unstructured":"Frieze, A.M., Clarke, M.R., et al.: Approximation algorithms for the m-dimensional 0\u20131 knapsack problem: worst-case and probabilistic analyses. Eur. J. Oper. Res. 15(1), 100\u2013109 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"10170_CR9","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., et\u00a0al.: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of Discrete Mathematics. Elsevier, p 287\u2013326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"10170_CR10","unstructured":"IAB: Internet advertising revenue report: Full year 2022. (2022). https:\/\/www.iab.com\/wp-content\/uploads\/2023\/04\/IAB_PwC_Internet_Advertising_Revenue_Report_2022.pdf. [Online; Accessed on: 2023-05-03]"},{"key":"10170_CR11","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"1","key":"10170_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s13198-017-0590-z","volume":"9","author":"A Kaul","year":"2018","unstructured":"Kaul, A., Aggarwal, S., Gupta, A., et al.: Optimal advertising on a two-dimensional web banner. Int. J. Syst. Assur. Eng. Manag. 9(1), 306\u2013311 (2018)","journal-title":"Int. J. Syst. Assur. Eng. Manag."},{"key":"10170_CR13","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Introduction to NP-Completeness of knapsack problems, Springer Berlin Heidelberg, chap Introduction to NP-Completeness of Knapsack Problems, pp 483\u2013493 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_16","DOI":"10.1007\/978-3-540-24777-7_16"},{"key":"10170_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106226","volume":"140","author":"G Kim","year":"2020","unstructured":"Kim, G., Moon, I.: Online banner advertisement scheduling for advertising effectiveness. Comput. Ind. Eng. 140, 106226 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"10170_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18645-0","author":"S Kumar","year":"2016","unstructured":"Kumar, S.: Optimization Issues in Web and Mobile Advertising. Springer International Publishing (2016). https:\/\/doi.org\/10.1007\/978-3-319-18645-0","journal-title":"Springer International Publishing"},{"key":"10170_CR16","doi-asserted-by":"publisher","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer Berlin Heidelberg (2003), https:\/\/doi.org\/10.1007\/978-3-662-04565-7","DOI":"10.1007\/978-3-662-04565-7"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10170-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10170-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10170-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T02:04:06Z","timestamp":1718935446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10170-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,25]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["10170"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10170-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,3,25]]},"assertion":[{"value":"7 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}