{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:32:37Z","timestamp":1759667557203},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10878-010-9290-1","type":"journal-article","created":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T20:21:40Z","timestamp":1264623700000},"page":"1-14","source":"Crossref","is-referenced-by-count":8,"title":["Max-coloring paths: tight bounds and extensions"],"prefix":"10.1007","volume":"24","author":[{"given":"Telikepalli","family":"Kavitha","sequence":"first","affiliation":[]},{"given":"Juli\u00e1n","family":"Mestre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,28]]},"reference":[{"key":"9290_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 (2004) Scheduling algorithms, 4th edn. Springer, Berlin","edition":"4"},{"key":"9290_CR2","unstructured":"Epstein L, Levin A (2007) On the max-coloring problem. In: Proceedings of the 5th workshop on approximation and online algorithms"},{"issue":"3","key":"9290_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 VT (2006) Weighted coloring: further complexity and approximability results. Inf Process Lett 97(3):98\u2013103","journal-title":"Inf Process Lett"},{"issue":"2","key":"9290_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow HN, Tarjan RE (1985) A linear-time algorithm for a special case of disjoint set union. J\u00a0Comput Syst Sci 30(2):209\u2013221","journal-title":"J\u00a0Comput Syst Sci"},{"issue":"2","key":"9290_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"DJ Guan","year":"1997","unstructured":"Guan DJ, Zhu X (1997) A coloring problem for weighted graphs. Inf Process Lett 61(2):77\u201381","journal-title":"Inf Process Lett"},{"key":"9290_CR6","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson MM, Shachnai H (2008) Batch coloring flat graphs and thin. In: Proceedings of the 11th Scandinavian workshop on algorithm theory, pp\u00a0198\u2013209","DOI":"10.1007\/978-3-540-69903-3_19"},{"key":"9290_CR7","unstructured":"Han Y, Thorup M (2002) Integer sorting in $O(n\\sqrt{\\log \\log n})$ expected time and linear space. In: Proceedings of the 43th annual IEEE symposium on foundations of computer science, pp\u00a0135\u2013144"},{"key":"9290_CR8","unstructured":"Han C-C, Hou C-J, Shin KJ (1995) On slot reuse for isochronous services in DQDB servers. In Proc of 16th IEEE real-time systems symposium, pp\u00a0222\u2013231"},{"key":"9290_CR9","unstructured":"Liu H, Beck M, Huang J (2006) Dynamic co-scheduling of distributed computation and replication. In: Proc of CCGRID, pp\u00a0592\u2013600"},{"key":"9290_CR10","doi-asserted-by":"crossref","unstructured":"Pemmaraju SV, Raman R (2005) Approximation algorithms for the max-coloring problem. In: Proceedings of the 32th international colloquium on automata, languages and programming, pp\u00a01064\u20131075","DOI":"10.1007\/11523468_86"},{"key":"9290_CR11","volume-title":"Distributed operating systems","author":"AS Tanenbaum","year":"1995","unstructured":"Tanenbaum AS (1995) Distributed operating systems. Prentice Hall, New York"},{"issue":"2","key":"9290_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan RE (1975) Efficiency of a good but not linear set union algorithm. J ACM 22(2):215\u2013225","journal-title":"J ACM"},{"issue":"2","key":"9290_CR13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"18","author":"RE Tarjan","year":"1979","unstructured":"Tarjan RE (1979) A class of algorithms which require nonlinear time to maintain disjoint sets. J Comput Syst Sci 18(2):110\u2013127","journal-title":"J Comput Syst Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10878-010-9290-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T01:05:56Z","timestamp":1551143156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9290-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,28]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9290"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9290-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,28]]}}}