{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:45:01Z","timestamp":1774417501599,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030199548","type":"print"},{"value":"9783030199555","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_1","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3064-5884","authenticated-orcid":false,"given":"Yousef M.","family":"Alhamdan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6144-0251","authenticated-orcid":false,"given":"Alexander","family":"Kononov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-18263-6_1","volume-title":"Approximation and Online Algorithms","author":"A Ageev","year":"2015","unstructured":"Ageev, A., Kononov, A.: Improved approximations for the max k-colored clustering problem. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 1\u201310. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18263-6_1"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-40313-2_7","volume-title":"Mathematical Foundations of Computer Science 2013","author":"E Angel","year":"2013","unstructured":"Angel, E., Bampis, E., Kononov, A., Paparas, D., Pountourakis, E., Zissimopoulos, V.: Clustering on k-edge-colored graphs. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 50\u201361. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-2_7"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2016.04.017","volume":"211","author":"E Angel","year":"2016","unstructured":"Angel, E., Bampis, E., Kononov, A., Paparas, D., Pountourakis, E., Zissimopoulos, V.: Clustering on k-edge-colored graphs. Discrete Appl. Math. 211, 15\u201322 (2016)","journal-title":"Discrete Appl. Math."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0012-365X(96)00160-4","volume":"165\u2013166","author":"J Bang-Jensen","year":"1997","unstructured":"Bang-Jensen, J., Gutin, G.: Alternating cycles and paths in edge-coloured multigraphs: a servey. Discrete Math. 165\u2013166, 39\u201360 (1997)","journal-title":"Discrete Math."},{"key":"1_CR5","unstructured":"Cai, L., Leung, O.-Y.: Alternating path and coloured clustering (2018). arXiv:1807.10531"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondrak, J.: Approximation algorithm for allocation problem improving the factor of $$1-\\frac{1}{e}$$. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 667\u2013676 (2006)","DOI":"10.1109\/FOCS.2006.14"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J Hastad","year":"2001","unstructured":"Hastad, J.: Some optimal inapproximability results. J. ACM 48, 798\u2013859 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithm for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00373-008-0789-5","volume":"24","author":"M Kano","year":"2008","unstructured":"Kano, M., Li, X.: Monochromatic and heterochromatic subgraphs in edge-colored graphs - a survey. Graphs Comb. 24, 237\u2013263 (2008)","journal-title":"Graphs Comb."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.geb.2013.10.002","volume":"82","author":"JM Kleinberg","year":"2013","unstructured":"Kleinberg, J.M., Ligett, K.: Information-sharing and privacy in social networks. Games Econ. Behav. 82, 702\u2013716 (2013)","journal-title":"Games Econ. Behav."},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Wiliiamson","year":"2011","unstructured":"Wiliiamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:32:30Z","timestamp":1710361950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}