{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T06:10:07Z","timestamp":1736662207659,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_13","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"117-128","source":"Crossref","is-referenced-by-count":0,"title":["Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance"],"prefix":"10.1007","author":[{"given":"Gruia","family":"Calinescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Pelsmajer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of ACM"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Berry, R.A., Modiano, E.: On the benefit of tunability in reducing electronic port counts in WDM\/TDM networks. In: INFOCOM, vol.\u00a02, pp. 1340\u20131351 (2004)","DOI":"10.1109\/INFCOM.2004.1357019"},{"issue":"8","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/JSAC.2005.852240","volume":"23","author":"R.A. Berry","year":"2005","unstructured":"Berry, R.A., Modiano, E.: Optimal transceiver scheduling in WDM\/TDM networks. IEEE Journal on Selected Areas in Communications\u00a023(8), 1471\u20131495 (2005)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Canadian J. Math."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45753-4_11","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"U. Feige","year":"2002","unstructured":"Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge coloring in multigraphs. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 108\u2013121. Springer, Heidelberg (2002)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(94)90112-0","volume":"128","author":"A.J.W. Hilton","year":"1994","unstructured":"Hilton, A.J.W., de Werra, D.: A sufficient condition for equitable edge-colourings of simple graphs. Discrete Mathematics\u00a0128, 179\u2013201 (1994)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput.\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"13_CR8","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Elsevier Science, Amsterdam (1986)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An ${O}(\\sqrt{|V|} |e|)$ algorithm for finding maximum matching in general graphs. In: FOCS, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Phys.\u00a028, 148\u2013151 (1949)","journal-title":"J. Math. Phys."}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:02:19Z","timestamp":1736658139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11944836_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}