{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:50:10Z","timestamp":1725983410122},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_13","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"153-164","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Covering with Clubs: Complexity and Approximability"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Sikora","sequence":"additional","affiliation":[]},{"given":"Italo","family":"Zoppis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba, R.D.: A graph-theoretic definition of a sociometric clique. J. Math. Sociol. 3, 113\u2013126 (1973)","journal-title":"J. Math. Sociol."},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1007\/s00453-017-0344-y","volume":"80","author":"Y Asahiro","year":"2017","unstructured":"Asahiro, Y., Doi, Y., Miyano, E., Samizo, K., Shimizu, H.: Optimal approximation algorithms for maximum distance-bounded subgraph problems. Algorithmica 80, 1834\u20131856 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10(1), 23\u201339 (2005)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J Bourjolly","year":"2002","unstructured":"Bourjolly, J., Laporte, G., Pesant, G.: An exact algorithm for the maximum k-club problem in an undirected graph. Eur. J. Oper. Res. 138(1), 21\u201328 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"13_CR5","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.dam.2007.10.015","volume":"156","author":"MR Cerioli","year":"2008","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Martinhon, C.A.J., Protti, F., Reed, B.A.: Partition into cliques for cubic graphs: planar case, complexity and approximation. Discrete Appl. Math. 156(12), 2270\u20132278 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1051\/ita\/2011106","volume":"45","author":"MR Cerioli","year":"2011","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO Theor. Inf. Appl. 45(3), 331\u2013346 (2011)","journal-title":"RAIRO Theor. Inf. Appl."},{"issue":"9","key":"13_CR7","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00607-012-0263-3","volume":"95","author":"M Chang","year":"2013","unstructured":"Chang, M., Hung, L., Lin, C., Su, P.: Finding large k-clubs in undirected graphs. Computing 95(9), 739\u2013758 (2013)","journal-title":"Computing"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/jgt.21725","volume":"75","author":"WJ Desormeaux","year":"2014","unstructured":"Desormeaux, W.J., Haynes, T.W., Henning, M.A., Yeo, A.: Total domination in graphs with diameter 2. J. Graph Theory 75(1), 91\u2013103 (2014)","journal-title":"J. Graph Theory"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00373-011-1026-1","volume":"27","author":"A Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs. Graphs Comb. 27(3), 399\u2013411 (2011)","journal-title":"Graphs Comb."},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR11","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)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dam.2014.04.016","volume":"174","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Rafiey, A.: Finding clubs in graph classes. Discrete Appl. Math. 174, 57\u201365 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.7155\/jgaa.00352","volume":"19","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: Parameterized algorithmics and computational experiments for finding 2-clubs. J. Graph Algorithms Appl. 19(1), 155\u2013190 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"13_CR14","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 algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a symposium on the Complexity of Computer Computations, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 20\u201322 March 1972. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/a9010021","volume":"9","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz, C.: Multivariate algorithmics for finding cohesive subnetworks. Algorithms 9(1), 21 (2016)","journal-title":"Algorithms"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.dam.2015.04.029","volume":"193","author":"C Komusiewicz","year":"2015","unstructured":"Komusiewicz, C., Sorge, M.: An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discrete Appl. Math. 193, 145\u2013161 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1007\/s13278-016-0326-0","volume":"6","author":"S Laan","year":"2016","unstructured":"Laan, S., Marx, M., Mokken, R.J.: Close communities in social networks: boroughs and 2-clubs. Social Netw. Anal. Min. 6(1), 20:1\u201320:16 (2016)","journal-title":"Social Netw. Anal. Min."},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken, R.: Cliques, clubs and clans. Qual. Quant. Int. J. Methodol. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant. Int. J. Methodol."},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1007\/s13278-016-0345-x","volume":"6","author":"RJ Mokken","year":"2016","unstructured":"Mokken, R.J., Heemskerk, E.M., Laan, S.: Close communication and 2-clubs in corporate networks: Europe 2010. Social Netw. Anal. Min. 6(1), 40:1\u201340:19 (2016)","journal-title":"Social Netw. Anal. Min."},{"issue":"3\u20134","key":"13_CR21","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1007\/s00453-011-9503-8","volume":"62","author":"IA Pirwani","year":"2012","unstructured":"Pirwani, I.A., Salavatipour, M.R.: A weakly robust PTAS for minimum clique partition in unit disk graphs. Algorithmica 62(3\u20134), 1050\u20131072 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"13_CR22","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A Sch\u00e4fer","year":"2012","unstructured":"Sch\u00e4fer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5), 883\u2013891 (2012)","journal-title":"Optim. Lett."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Zoppis, I., Dondi, R., Santoro, E., Castelnuovo, G., Sicurello, F., Mauri, G.: Optimizing social interaction - a computational approach to support patient engagement. In: Zwiggelaar, R., Gamboa, H., Fred, A.L.N., i Badia, S.B. (eds.) Proceedings of the 11th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2018) - Volume 5: HEALTHINF, Funchal, Madeira, Portugal, 19\u201321 January 2018, pp. 651\u2013657. SciTePress (2018)","DOI":"10.5220\/0006730606510657"},{"issue":"1","key":"13_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T08:08:54Z","timestamp":1571558934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}