{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:08:10Z","timestamp":1762297690721},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_12","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"132-143","source":"Crossref","is-referenced-by-count":4,"title":["Approximation and Hardness Results for the Maximum Edge q-coloring Problem"],"prefix":"10.1007","author":[{"given":"Anna","family":"Adamaszek","sequence":"first","affiliation":[]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Erd\u0151s, P., Simonovits, M., S\u00f3s, V.T.: Anti-ramsey theorems. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), Vol. II, vol.\u00a010, pp. 633\u2013643. Colloq. Math. Soc. J\u00e1nos Bolyai (1975)"},{"key":"12_CR2","unstructured":"Feng, W., Chen, P., Zhang, B.: Approximate maximum edge coloring within factor 2: a further analysis. In: ISORA, pp. 182\u2013189 (2008)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/978-3-540-72504-6_59","volume-title":"Theory and Applications of Models of Computation","author":"W. Feng","year":"2007","unstructured":"Feng, W., Zhang, L., Qu, W., Wang, H.: Approximation algorithms for maximum edge coloring problem. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 646\u2013658. Springer, Heidelberg (2007)"},{"issue":"11","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.tcs.2008.10.035","volume":"410","author":"W. Feng","year":"2009","unstructured":"Feng, W., Zhang, L., Wang, H.: Approximation algorithm for maximum edge coloring. Theor. Comput. Sci.\u00a0410(11), 1022\u20131029 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of ramsey theory: A survey. Graphs and Combinatorics (2010)","DOI":"10.1007\/s00373-010-0891-3"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s003730200022","volume":"18","author":"T. Jiang","year":"2002","unstructured":"Jiang, T.: Edge-colorings with no large polychromatic stars. Graphs and Combinatorics\u00a018(2), 303\u2013308 (2002)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01858468","volume":"12","author":"Y. Manoussakis","year":"1996","unstructured":"Manoussakis, Y., Spyratos, M., Tuza, Z., Voight, M.: Minimal colorings for properly colored subgraphs. Graphs and Combinatorics\u00a012(1), 345\u2013360 (1996)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/jgt.20140","volume":"51","author":"J.J. Montellano-Ballesteros","year":"2006","unstructured":"Montellano-Ballesteros, J.J.: On totally multicolored stars. Journal of Graph Theory\u00a051(3), 225\u2013243 (2006)","journal-title":"Journal of Graph Theory"},{"key":"12_CR9","first-page":"2223","volume-title":"INFOCOM","author":"A. Raniwala","year":"2005","unstructured":"Raniwala, A., Chiueh, T.-c.: Architecture and algorithms for an ieee 802.11-based multi-channel wireless mesh network. In: INFOCOM, pp. 2223\u20132234. IEEE, Los Alamitos (2005)"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/997122.997130","volume":"8","author":"A. Raniwala","year":"2004","unstructured":"Raniwala, A., Gopalan, K., Chiueh, T.-c.: Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. Mobile Computing and Communications Review\u00a08(2), 50\u201365 (2004)","journal-title":"Mobile Computing and Communications Review"},{"key":"12_CR11","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2004","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2004)"}],"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-17514-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T16:56:47Z","timestamp":1553273807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}