{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:02:04Z","timestamp":1765231324942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_22","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"326-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Minimum Sum Colorings and\u00a0Maximum k-Colorable Subgraphs of\u00a0Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Ian","family":"DeHaan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Friggstad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"issue":"7","key":"22_CR1","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.dam.2008.08.020","volume":"158","author":"L Addario-Berry","year":"2010","unstructured":"Addario-Berry, L., Kennedy, W., King, A., Li, Z., Reed, B.: Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7), 765\u2013770 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183\u2013202 (1998)","journal-title":"Inf. Comput."},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1998.0938","volume":"28","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. J. Algorithms 28(2), 339\u2013365 (1998)","journal-title":"J. Algorithms"},{"issue":"7","key":"22_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.ipl.2008.12.007","volume":"109","author":"V Chakaravarthy","year":"2009","unstructured":"Chakaravarthy, V., Roy, S.: Approximating maximum weight k-colorable subgraphs in chordal graphs. Inf. Process. Lett. 109(7), 365\u2013368 (2009)","journal-title":"Inf. Process. Lett."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-20807-2_8","volume-title":"Integer Programming and Combinatoral Optimization","author":"D Chakrabarty","year":"2011","unstructured":"Chakrabarty, D., Swamy, C.: Facility location with client latencies: linear programming based techniques for minimum latency problems. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 92\u2013103. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_8"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U Feige","year":"2004","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discret. Math. 18(2), 219\u2013225 (2004)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57(2), 187\u2013199 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-31833-0_8","volume-title":"Approximation and Online Algorithms","author":"R Gandhi","year":"2005","unstructured":"Gandhi, R., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 68\u201382. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31833-0_8"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"22_CR10","unstructured":"Gonen, M.: Coloring problems on interval graphs and trees. Master\u2019s thesis, School of Computer Science, The Open University, Tel-Aviv (2001)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00453-003-1031-8","volume":"37","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37, 187\u2013209 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1006\/jagm.2001.1210","volume":"42","author":"M Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. J. Algorithms 42(2), 334\u2013366 (2002)","journal-title":"J. Algorithms"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1921659.1921668","volume":"7","author":"M Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, M., Kortsarz, G., Sviridenko, M.: Sum edge coloring of multigraphs via configuration LP. ACM Trans. Algorithms 7(2), 1\u201321 (2011)","journal-title":"ACM Trans. Algorithms"},{"key":"22_CR14","unstructured":"Kubicka, E.: The chromatic sum and efficient tree algorithms. Ph.D. thesis, Western Michigan University (1989)"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-004-1111-4","volume":"40","author":"M Malafiejski","year":"2004","unstructured":"Malafiejski, M., Giaro, K., Janczewski, R., Kubale, M.: Sum coloring of bipartite graphs with bounded degree. Algorithmica 40, 235\u2013244 (2004)","journal-title":"Algorithmica"},{"issue":"5","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.dam.2008.04.002","volume":"157","author":"D Marx","year":"2009","unstructured":"Marx, D.: Complexity results for minimum sum edge coloring. Discret. Appl. Math. 157(5), 1034\u20131045 (2009)","journal-title":"Discret. Appl. Math."},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/11575467_21","volume-title":"Programming Languages and Systems","author":"FMQ Pereira","year":"2005","unstructured":"Pereira, F.M.Q., Palsberg, J.: Register allocation via coloring of chordal graphs. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 315\u2013329. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575467_21"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Post, I., Swamy, C.: Linear programming-based approximation algorithms for multi-vehicle minimum latency problems. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 512\u2013531 (2014)","DOI":"10.1137\/1.9781611973730.35"},{"issue":"2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M Yannakakis","year":"1987","unstructured":"Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graphs. Inf. Process. Lett. 24(2), 133\u2013137 (1987)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:07:29Z","timestamp":1690474049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"47","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":"51% - 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.1","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":"10","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)"}}]}}