{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:34Z","timestamp":1725484294740},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540436768"},{"type":"electronic","value":"9783540478676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_29","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T14:47:17Z","timestamp":1179931637000},"page":"415-424","source":"Crossref","is-referenced-by-count":5,"title":["Approximating the Advertisement Placement Problem"],"prefix":"10.1007","author":[{"given":"Ari","family":"Freund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Seffi","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"29_CR1","unstructured":"Adler, M., Gibbons, P., Matias, Y.: Scheduling space-sharing for internet advertising. Journal of Scheduling (to appear). Also available electronically at \n                  \n                    http:\/\/www.cs.umass.edu\/~micah\/pubs\/pubs.html\n                  \n                  \n                ."},{"key":"29_CR2","unstructured":"Lawler, E., Lenstra, J., Rinnooy Kan, A., Shmoys., D.: Sequencing and scheduling: algorithms and complexity. In Graves, S., Rinnooy Kan, A., Zipkin, P., eds.: Handbooks in Operations Research and Management Science, Vol.4: Logistics for Production and Inventory. North Holland (1993) 445\u2013522"},{"key":"29_CR3","first-page":"27","volume":"10","author":"E. Lawler","year":"1976","unstructured":"Lawler, E.: Sequencing to minimize the weighted number of tardy jobs. Recherche Operationnel 10 (1976) 27\u201333","journal-title":"Recherche Operationnel"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1287\/opre.26.1.121","volume":"26","author":"H. Kise","year":"1978","unstructured":"Kise, H., Ibaraki, T., Mine, H.: A solvable case of one machine scheduling problem with ready and due dates. Operations Research 26 (1978) 121\u2013126","journal-title":"Operations Research"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"E. Lawler","year":"1990","unstructured":"Lawler, E.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research 26 (1990) 125\u2013133","journal-title":"Annals of Operations Research"},{"key":"29_CR6","unstructured":"Dawadne, M., Kumar, S., Srishkandarajah, C.: Performance bounds of algorithms for scheduling advertisements on a web page. Working paper (2001). Available at \n                  \n                    http:\/\/www.utdallas.edu\/~chelliah\/wpapers.html\n                  \n                  \n                ."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer-Verlag (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. Graham","year":"1966","unstructured":"Graham, R.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45 (1966) 1563\u20131581","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T17:43:59Z","timestamp":1550339039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-47867-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}