{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T05:25:01Z","timestamp":1749101101420},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_11","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"87-96","source":"Crossref","is-referenced-by-count":5,"title":["Max-Coloring Paths: Tight Bounds and Extensions"],"prefix":"10.1007","author":[{"given":"Telikepalli","family":"Kavitha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juli\u00e1n","family":"Mestre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)","edition":"4"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-77918-6_12","volume-title":"Approximation and Online Algorithms","author":"L. Epstein","year":"2008","unstructured":"Epstein, L., Levin, A.: On the max-coloring problem. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 142\u2013155. Springer, Heidelberg (2008)"},{"issue":"3","key":"11_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ipl.2005.09.013","volume":"97","author":"B. Escoffier","year":"2006","unstructured":"Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Inf. Process. Lett.\u00a097(3), 98\u2013103 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci.\u00a030(2), 209\u2013221 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"D.J. Guan","year":"1997","unstructured":"Guan, D.J., Zhu, X.: A coloring problem for weighted graphs. Inf. Process. Lett.\u00a061(2), 77\u201381 (1997)","journal-title":"Inf. Process. Lett."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-69903-3_19","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"M.M. Halld\u00f3rsson","year":"2008","unstructured":"Halld\u00f3rsson, M.M., Shachnai, H.: Batch coloring flat graphs and thin. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 198\u2013209. Springer, Heidelberg (2008)"},{"key":"11_CR7","unstructured":"Han, Y., Thorup, M.: Integer sorting in \n                  \n                    \n                  \n                  $O(n \\sqrt{\\log \\log n})$\n                 expected time and linear space. In: Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science, pp. 135\u2013144 (2002)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/11523468_86","volume-title":"Automata, Languages and Programming","author":"S.V. Pemmaraju","year":"2005","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1064\u20131075. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:36:44Z","timestamp":1619768204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}