{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:23Z","timestamp":1725558383524},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_36","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"383-394","source":"Crossref","is-referenced-by-count":4,"title":["Online Selection of Intervals and t-Intervals"],"prefix":"10.1007","author":[{"given":"Unnar Th.","family":"Bachmann","sequence":"first","affiliation":[]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Ros\u00e9n, A.: Competitive non-preemptive call control. In: SODA, pp. 312\u2013320 (1994)"},{"key":"36_CR2","unstructured":"Bachmann, U.T.: Online t-Interval Scheduling. MSc thesis, School of CS, Reykjavik Univ. (December 2009)"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Bachmann, U.T., Halld\u00f3rsson, M.M., Shachnai, H.: Online selection of intervals and t-intervals (2010), http:\/\/www.cs.technion.ac.il\/~hadas\/PUB\/onint_full.pdf","DOI":"10.1007\/978-3-642-13731-0_36"},{"key":"36_CR4","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J.S., Shachnai, H., Shapira, I.: Scheduling split intervals. In: SODA, pp. 732\u2013741 (2002)"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.disopt.2006.05.010","volume":"3","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Rawitz, D.: Using fractional primal-dual to schedule split intervals with demands. Discrete Optimization\u00a03(4), 275\u2013287 (2006)","journal-title":"Discrete Optimization"},{"key":"36_CR6","unstructured":"Butman, A., Hermelin, D., Lewenstein, M., Rawitz, D.: Optimization problems in multiple-interval graphs. In: SODA (2007)"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0304-3975(01)00411-X","volume":"289","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Taketomi, S.: Online independent sets. Theoretical Computer Science\u00a0289(2), 953\u2013962 (2002)","journal-title":"Theoretical Computer Science"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(94)90157-0","volume":"130","author":"M.M. Halld\u00f3rsson","year":"1994","unstructured":"Halld\u00f3rsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theoretical Comput. Sci.\u00a0130, 163\u2013174 (1994)","journal-title":"Theoretical Comput. Sci."},{"key":"36_CR9","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. In: Congr. Numer., vol.\u00a033, pp. 143\u2013153 (1981)"},{"key":"36_CR10","volume-title":"Algorithm Design","author":"J. Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Reading (2005)"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"A.W. Kolen","year":"2007","unstructured":"Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: A survey. Naval Research Logistics\u00a054, 530\u2013543 (2007)","journal-title":"Naval Research Logistics"},{"key":"36_CR12","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: SODA, pp. 302\u2013311 (1994)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F. Spieksma","year":"1999","unstructured":"Spieksma, F.: On the approximability of an interval scheduling problem. J. Sched.\u00a02, 215\u2013227 (1999)","journal-title":"J. Sched."},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theor. Comput. Sci.\u00a0130(1), 5\u201316 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T06:02:41Z","timestamp":1635487361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}