{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:20:51Z","timestamp":1743124851866,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_27","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"335-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Classes and Approximability of the Happy Set Problem"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Eto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ippei","family":"Terabaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-78825-8_9","volume-title":"Combinatorial Algorithms","author":"A Agrawal","year":"2018","unstructured":"Agrawal, A.: On the parameterized complexity of happy vertex coloring. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) IWOCA 2017. LNCS, vol. 10765, pp. 103\u2013115. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78825-8_9"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-44543-4_22","volume-title":"Combinatorial Algorithms","author":"NR Aravind","year":"2016","unstructured":"Aravind, N.R., Kalyanasundaram, S., Kare, A.S.: Linear time algorithms for happy vertex coloring problems for trees. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 281\u2013292. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_22"},{"key":"27_CR3","unstructured":"Aravind, N., Kalyanasundaram, S., Kare, A., Lauri, J.: Algorithms and hardness results for happy coloring problems. arXiv preprint arXiv:1705.08282 (2017)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-39881-1_27","volume-title":"WALCOM: Algorithms and Computation","author":"Y Asahiro","year":"2020","unstructured":"Asahiro, Y., Eto, H., Hanaka, T., Lin, G., Miyano, E., Terabaru, I.: Parameterized algorithms for the happy set problem. In: Rahman, M.S., Sadakane, K., Sung, W.-K. (eds.) WALCOM 2020. LNCS, vol. 12049, pp. 323\u2013328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39881-1_27"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Appl. Math. 121, 15\u201326 (2002)","journal-title":"Discrete Appl. Math."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $$o(n^{\\frac{1}{4}})$$ approximation for densest $$k$$-subgraph. In: STOC 2010, pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.ejor.2017.04.034","volume":"262","author":"N Bourgeois","year":"2017","unstructured":"Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.T.: Exact and superpolynomial approximation algorithms for the densest $$k$$-subgraph problem. Eur. J. Oper. Res. 262(3), 894\u2013903 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-36065-7_12","volume-title":"WALCOM: Algorithms and Computation","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.T.: Exact and approximation algorithms for densest k-subgraph. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748, pp. 114\u2013125. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36065-7_12"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2013.03.008","volume":"485","author":"H Broersma","year":"2013","unstructured":"Broersma, H., Golovach, P., Patel, V.: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoret. Comput. Sci. 485, 69\u201384 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"27_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"TN Bui","year":"1987","unstructured":"Bui, T.N., Chaudhuri, S., Leighton, F.T., Sipser, M.: Graph bisection algorithms with good average case behavior. Combinatorica 7(2), 171\u2013191 (1987)","journal-title":"Combinatorica"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., et al.: From gap-ETH to FPT-inapproximability: clique, dominating set, and more. In: FOCS 2017, pp. 743\u2013754 (2017)","DOI":"10.1109\/FOCS.2017.74"},{"issue":"9","key":"27_CR12","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ipl.2014.04.009","volume":"114","author":"MS Chang","year":"2014","unstructured":"Chang, M.S., Chen, L.H., Hung, L.J., Rossmanith, P., Wu, G.H.: Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. 114(9), 510\u2013513 (2014)","journal-title":"Inf. Process. Lett."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-75172-6_20","volume-title":"WALCOM: Algorithms and Computation","author":"J Choudhari","year":"2018","unstructured":"Choudhari, J., Reddy, I.V.: On structural parameterizations of happy coloring, empire coloring and boxicity. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 228\u2013239. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75172-6_20"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D Corneil","year":"1984","unstructured":"Corneil, D., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9(1), 27\u201339 (1984)","journal-title":"Discrete Appl. Math."},{"key":"27_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, Crowds, and Markets: Reasoning About a Highly Connected World","author":"D Easley","year":"2010","unstructured":"Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge (2010)"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense $$k$$-subgraph problem. Algorithmica 29(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"27_CR17","unstructured":"Feige, U., Seltser, M.: On the densest $$k$$-subgraph problem. Technical report CS97-16, Weizmann Institute, Rehovot (1997). http:\/\/www.wisdom.weizmann.ac.il"},{"key":"27_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"4","key":"27_CR19","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S Khot","year":"2006","unstructured":"Khot, S.: Ruling out PTAS for graph min bisection, dense $$k$$ subgraph, and bipartite clique. SIAM J. Comput. 36(4), 1025\u20131071 (2006)","journal-title":"SIAM J. Comput."},{"key":"27_CR20","unstructured":"Kortsarz, G., Peleg, D.: On choosing a dense subgraph. In: FOCS 1993, pp. 692\u2013701 (1993)"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cor.2018.11.015","volume":"103","author":"R Lewis","year":"2019","unstructured":"Lewis, R., Thiruvady, D., Morgan, K.: Finding happiness: an analysis of the maximum happy vertices problem. Comput. Oper. Res. 103, 265\u2013276 (2019)","journal-title":"Comput. Oper. Res."},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Manurangsi, P.: Almost-polynomial ratio ETH-hardness of approximating densest $$k$$-subgraph. In: STOC 2017, pp. 954\u2013961 (2017)","DOI":"10.1145\/3055399.3055412"},{"issue":"1","key":"27_CR23","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s00453-014-9956-7","volume":"74","author":"T Nonner","year":"2016","unstructured":"Nonner, T.: PTAS for densest $$k$$-subgraph in interval graphs. Algorithmica 74(1), 528\u2013539 (2016)","journal-title":"Algorithmica"},{"issue":"2","key":"27_CR24","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13, 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"key":"27_CR26","volume-title":"Introduction to Graph Theory","author":"D West","year":"2000","unstructured":"West, D.: Introduction to Graph Theory. Prentice-Hall Inc, Englewood Cliffs (2000)"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-21398-9_13","volume-title":"Computing and Combinatorics","author":"P Zhang","year":"2015","unstructured":"Zhang, P., Jiang, T., Li, A.: Improved approximation algorithms for the maximum happy vertices and edges problems. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 159\u2013170. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_13"},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2015.06.003","volume":"593","author":"P Zhang","year":"2015","unstructured":"Zhang, P., Li, A.: Algorithmic aspects of homophyly of networks. Theoret. Comput. Sci. 593, 117\u2013131 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"27_CR29","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1007\/s00453-017-0302-8","volume":"80","author":"P Zhang","year":"2018","unstructured":"Zhang, P., Xu, Y., Jiang, T., Li, A., Lin, G., Miyano, E.: Improved approximation algorithms for the maximum happy vertices and edges problems. Algorithmica 80(5), 1412\u20131438 (2018)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T04:46:14Z","timestamp":1668055574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}