Anna Adamaszek, Alexandru Popa. Approximation and Hardness Results for the Maximum Edge ::::q::::-coloring Problem. In Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park, editors, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II. Volume 6507 of Lecture Notes in Computer Science, pages 132-143, Springer, 2010. [doi]
@inproceedings{AdamaszekP10,
title = {Approximation and Hardness Results for the Maximum Edge ::::q::::-coloring Problem},
author = {Anna Adamaszek and Alexandru Popa},
year = {2010},
doi = {10.1007/978-3-642-17514-5_12},
url = {http://dx.doi.org/10.1007/978-3-642-17514-5_12},
researchr = {https://researchr.org/publication/AdamaszekP10},
cites = {0},
citedby = {0},
pages = {132-143},
booktitle = {Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II},
editor = {Otfried Cheong and Kyung-Yong Chwa and Kunsoo Park},
volume = {6507},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-17513-8},
}