{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T05:33:40Z","timestamp":1771652020125,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00454-021-00327-y","type":"journal-article","created":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T14:05:44Z","timestamp":1630073144000},"page":"1401-1414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs"],"prefix":"10.1007","volume":"66","author":[{"given":"A. Karim","family":"Abu-Affash","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0154-5013","authenticated-orcid":false,"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]},{"given":"Shakhar","family":"Smorodinsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,27]]},"reference":[{"issue":"3","key":"327_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00454-009-9143-9","volume":"41","author":"E Ackerman","year":"2009","unstructured":"Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discrete Comput. Geom. 41(3), 365\u2013375 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"327_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1\u20139 (1997)","journal-title":"Combinatorica"},{"key":"327_CR3","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."},{"issue":"3","key":"327_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.21455","volume":"60","author":"MT Almeida","year":"2012","unstructured":"Almeida, M.T., Carvalho, F.D.: Integer models and upper bounds for the $$3$$-club problem. Networks 60(3), 155\u2013166 (2012)","journal-title":"Networks"},{"issue":"6","key":"327_CR5","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1007\/s00453-017-0344-y","volume":"80","author":"Y Asahiro","year":"2018","unstructured":"Asahiro, Y., Doi, Y., Miyano, E., Samizo, K., Shimizu, H.: Optimal approximation algorithms for maximum distance-bounded subgraph problems. Algorithmica 80(6), 1834\u20131856 (2018)","journal-title":"Algorithmica"},{"key":"327_CR6","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Miyano, E., Samizo, K.: Approximating maximum diameter-bounded subgraphs. In: LATIN 2010: Theoretical Informatics. Lecture Notes in Comput. Sci., vol. 6034, pp. 615\u2013626. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-12200-2_53"},{"issue":"1","key":"327_CR7","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."},{"key":"327_CR8","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization, Suppl. vol. A, pp. 1\u201374. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"1","key":"327_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J-M Bourjolly","year":"2002","unstructured":"Bourjolly, J.-M., 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":"3","key":"327_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ejor.2010.11.023","volume":"210","author":"FD Carvalho","year":"2011","unstructured":"Carvalho, F.D., Almeida, M.T.: Upper bounds and heuristics for the $$2$$-club problem. Eur. J. Oper. Res. 210(3), 489\u2013494 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"327_CR11","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00607-012-0263-3","volume":"95","author":"M-S Chang","year":"2013","unstructured":"Chang, M.-S., Hung, L.-J., Lin, C.-R., Su, P.-C.: Finding large $$k$$-clubs in undirected graphs. Computing 95(9), 739\u2013758 (2013)","journal-title":"Computing"},{"issue":"2","key":"327_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00454-006-1260-0","volume":"37","author":"V Chepoi","year":"2007","unstructured":"Chepoi, V., Estellon, B., Vax\u00e8s, Y.: Covering planar graphs with a fixed number of balls. Discrete Comput. Geom. 37(2), 237\u2013244 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20133","key":"327_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"327_CR14","doi-asserted-by":"crossref","unstructured":"da Fonseca, G.D., de Figueiredo, C.M.H., Pereira de S\u00e1, V.G., Machado, R.C.S.: Efficient sub-$$5$$ approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. 540\/541, 70\u201381 (2014)","DOI":"10.1016\/j.tcs.2014.01.023"},{"issue":"3","key":"327_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A Gr\u00e4f","year":"1998","unstructured":"Gr\u00e4f, A., Stumpf, M., Wei\u00dfenfels, G.: On coloring unit disk graphs. Algorithmica 20(3), 277\u2013293 (1998)","journal-title":"Algorithmica"},{"key":"327_CR16","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. Mathematical Surveys and Monographs, vol. 173. American Mathematical Society, Providence (2011)","DOI":"10.1090\/surv\/173"},{"key":"327_CR17","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"2","key":"327_CR18","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00454-003-2859-z","volume":"31","author":"J Matou\u0161ek","year":"2004","unstructured":"Matou\u0161ek, J.: Bounded VC-dimension implies a fractional Helly theorem. Discrete Comput. Geom. 31(2), 251\u2013255 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"327_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.dam.2013.10.017","volume":"166","author":"J Pattillo","year":"2014","unstructured":"Pattillo, J., Wang, Y., Butenko, S.: Approximating $$2$$-cliques in unit disk graphs. Discrete Appl. Math. 166, 178\u2013187 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"327_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1), 9\u201318 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"327_CR21","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2011.10.027","volume":"218","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., Boginski, V.: Identifying large robust network clusters via new compact formulations of maximum $$k$$-club problems. Eur. J. Oper. Res. 218(2), 316\u2013326 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"327_CR22","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, 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-021-00327-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-021-00327-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-021-00327-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T05:04:47Z","timestamp":1635656687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-021-00327-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,27]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s00454-021-00327-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,27]]},"assertion":[{"value":"11 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}