{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:33:50Z","timestamp":1743111230874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711461"},{"type":"electronic","value":"9783319711478"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_22","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"317-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"given":"Fu-Hong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Hsiang-Hsuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24592-6_1","volume-title":"Approximation and Online Algorithms","author":"U Adamy","year":"2004","unstructured":"Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 1\u201312. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24592-6_1"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-39658-1_5","volume-title":"Algorithms - ESA 2003","author":"M Alicherry","year":"2003","unstructured":"Alicherry, M., Bhatia, R.: Line system design and a generalized coloring problem. In: Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 19\u201330. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_5"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2006.06.014","volume":"363","author":"Y Azar","year":"2006","unstructured":"Azar, Y., Fiat, A., Levy, M., Narayanaswamy, N.S.: An improved algorithm for online coloring of intervals with bandwidth. Theor. Comput. Sci. 363(1), 18\u201327 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00453-013-9807-y","volume":"70","author":"J Chang","year":"2014","unstructured":"Chang, J., Gabow, H.N., Khuller, S.: A model for minimizing active processor time. Algorithmica 70(3), 368\u2013405 (2014)","journal-title":"Algorithmica"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Chang, J., Khuller, S., Mukherjee. K.: LP rounding and combinatorial algorithms for minimizing active and busy time. In: SPAA, pp. 118\u2013127 (2014)","DOI":"10.1145\/2612669.2612689"},{"issue":"4","key":"22_CR7","first-page":"487","volume":"22","author":"M Chrobak","year":"1988","unstructured":"Chrobak, M., Slusarek, M.: On some packing problem related to dynamic storage allocation. ITA 22(4), 487\u2013499 (1988)","journal-title":"ITA"},{"issue":"40\u201342","key":"22_CR8","doi-asserted-by":"publisher","first-page":"3553","DOI":"10.1016\/j.tcs.2010.05.011","volume":"411","author":"M Flammini","year":"2010","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40\u201342), 3553\u20133562 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M Garey","year":"1980","unstructured":"Garey, M., Johnson, D.S., Miller, G., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Meth. 1(2), 216\u2013227 (1980)","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-44666-4_15","volume-title":"Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques","author":"MM Halld\u00f3rsson","year":"2001","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Minimizing average completion of dedicated tasks and interval graphs. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX\/RANDOM -2001. LNCS, vol. 2129, pp. 114\u2013126. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44666-4_15"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jagm.1999.1022","volume":"34","author":"K Jansen","year":"2000","unstructured":"Jansen, K.: Approximation results for the optimum cost chromatic partition problem. J. Algorithms 34(1), 54\u201389 (2000)","journal-title":"J. Algorithms"},{"key":"22_CR13","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Minimizing busy time in multiple machine real-time scheduling. In: FSTTCS, pp. 169\u2013180 (2010)"},{"key":"22_CR14","first-page":"143","volume":"33","author":"H Kierstead","year":"1981","unstructured":"Kierstead, H., Trotter, W.: An extremal problem in recursive combinatorics. Congressus Numerantium 33, 143\u2013153 (1981)","journal-title":"Congressus Numerantium"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-62559-3_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"LG Kroon","year":"1997","unstructured":"Kroon, L.G., Sen, A., Deng, H., Roy, A.: The optimal cost chromatic partition problem for trees and interval graphs. In: d\u2019Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol. 1197, pp. 279\u2013292. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62559-3_23"},{"volume-title":"Graph Colorings","year":"2004","key":"22_CR16","unstructured":"Kubale, M. (ed.): Graph Colorings. American Mathematical Society, Providence (2004)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11590156_12","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"V Kumar","year":"2005","unstructured":"Kumar, V., Rudra, A.: Approximation algorithms for wavelength assignment. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 152\u2013163. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590156_12"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.tcs.2014.10.033","volume":"562","author":"G Mertzios","year":"2015","unstructured":"Mertzios, G., Shalom, M., Voloshin, A., Wong, P., Zaks, S.: Optimizing busy time on parallel machines. Theor. Comput. Sci. 562, 524\u2013541 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/PL00009252","volume":"23","author":"S Nicoloso","year":"1999","unstructured":"Nicoloso, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23(2), 109\u2013126 (1999)","journal-title":"Algorithmica"},{"key":"22_CR20","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Buffer minimization using max-coloring. In: SODA, pp. 562\u2013571 (2004)"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Ren, R., Tang, X.: Clairvoyant dynamic bin packing for job scheduling with minimum server usage time. In: SPAA, pp. 227\u2013237 (2016)","DOI":"10.1145\/2935764.2935775"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.tcs.2014.07.017","volume":"560","author":"M Shalom","year":"2014","unstructured":"Shalom, M., Voloshin, A., Wong, P., Yung, F., Zaks, S.: Online optimization of busy time on parallel machines. Theor. Comput. Sci. 560, 190\u2013206 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR23","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830\u2013831 (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:12:58Z","timestamp":1709809978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}