{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:01:26Z","timestamp":1760608886633,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T00:00:00Z","timestamp":1441324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T00:00:00Z","timestamp":1441324800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0103 and FA8651-12-2-0011"],"award-info":[{"award-number":["FA9550-12-1-0103 and FA8651-12-2-0011"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10479-015-1992-4","type":"journal-article","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T10:56:39Z","timestamp":1441364199000},"page":"17-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On robust clusters of minimum cardinality in networks"],"prefix":"10.1007","volume":"249","author":[{"given":"Chitra","family":"Balasubramaniam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,4]]},"reference":[{"key":"1992_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., & Kann, V. (2000). Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237, 123\u2013134.","journal-title":"Theoretical Computer Science"},{"key":"1992_CR2","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1016\/j.dam.2012.03.025","volume":"160","author":"O Amini","year":"2012","unstructured":"Amini, O., Peleg, D., P\u00e9rennes, S., Sau, I., & Saurabh, S. (2012). On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics, 160, 1661\u20131679.","journal-title":"Discrete Applied Mathematics"},{"key":"1992_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. (2005). Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization, 10, 23\u201339.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1992_CR4","first-page":"63","volume":"32","author":"G Chartrand","year":"1972","unstructured":"Chartrand, G., Kaugars, A., & Lick, D. R. (1972). Critically $$n$$-connected graphs. Proceedings of the American Mathematical Society, 32, 63\u201368.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"1992_CR5","first-page":"145","volume-title":"Ad hoc and sensor networks, wireless networks and mobile computing","author":"YP Chen","year":"2005","unstructured":"Chen, Y. P., Liestman, A. L., & Liu, J. (2005). Clustering algorithms for ad hoc wireless networks. In Y. Pan & Y. Xiao (Eds.), Ad hoc and sensor networks, wireless networks and mobile computing (pp. 145\u2013164). New York: Nova Science Publishers."},{"key":"1992_CR6","unstructured":"COLOR02\/03\/04: Graph Coloring and its Generalizaions. http:\/\/mat.gsia.cmu.edu\/COLOR03\/ . Accessed August 2015"},{"key":"1992_CR7","doi-asserted-by":"crossref","unstructured":"Diestel, R. (2010). Graph theory (4th ed.). Heidelberg: Springer.","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1992_CR8","unstructured":"Dimacs (1995) Cliques, coloring, and satisfiability: Second dimacs implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/ . Accessed August 2015"},{"key":"1992_CR9","unstructured":"Dimacs (2011) Graph partitioning and graph clustering: Tenth dimacs implementation challenge. http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml . Accessed August 2015"},{"key":"1992_CR10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., & R\u00e9nyi, A. (1959). On random graphs. Publicationes Mathematicae (Debrecen), 6, 290\u2013297.","journal-title":"Publicationes Mathematicae (Debrecen)"},{"issue":"3","key":"1992_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.21456","volume":"60","author":"RJ Faudree","year":"2012","unstructured":"Faudree, R. J., Gould, R. J., & Powell, J. S. (2012). Property $$P_{d, m}$$ and efficient design of reliable networks. Networks, 60(3), 167\u2013178.","journal-title":"Networks"},{"key":"1992_CR12","unstructured":"Feige, U. (2003). Vertex cover is hardest to approximate on regular graphs. Technical report MCS 03-15, Weizmann Institute"},{"key":"1992_CR13","unstructured":"FICO$$^{{\\rm TM}}$$. (2014). Xpress Optimization Suite 7.7.\u00a0 http:\/\/www.fico.com . Accessed August 2015"},{"key":"1992_CR14","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/0222039","volume":"22","author":"LM Kirousis","year":"1993","unstructured":"Kirousis, L. M., Serna, M., & Spirakis, P. (1993). Parallel complexity of the connected subgraph problem. SIAM Journal on Computing, 22, 573\u2013586.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"1992_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1009728720073","volume":"2","author":"S-C Liaw","year":"1998","unstructured":"Liaw, S.-C., & Chang, G. J. (1998). Generalized diameters and Rabin numbers of networks. Journal of Combinatorial Optimization, 2(4), 371\u2013384.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1992_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"R Luce","year":"1949","unstructured":"Luce, R., & Perry, A. (1949). A method of matrix analysis of group structure. Psychometrika, 14, 95\u2013116.","journal-title":"Psychometrika"},{"issue":"3","key":"1992_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10878-008-9206-5","volume":"20","author":"C Ma","year":"2010","unstructured":"Ma, C., Kim, D., Wang, Y., Wang, W., Sohaee, N., & Wu, W. (2010). Hardness of $$k$$-vertex-connected subgraph augmentation problem. Journal of Combinatorial Optimization, 20(3), 249\u2013258.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1992_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(78)90071-0","volume":"24","author":"DW Matula","year":"1978","unstructured":"Matula, D. W. (1978). $$k$$-Blocks and ultrablocks in graphs. Journal of Combinatorial Theory, Series B, 24, 1\u201313.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"1992_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2307\/3088904","volume":"68","author":"J Moody","year":"2003","unstructured":"Moody, J., & White, D. R. (2003). Structural cohesion and embeddedness: A hierarchical concept of social groups. American Sociological Review, 68, 103\u2013127.","journal-title":"American Sociological Review"},{"issue":"3","key":"1992_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C. H., & Yannakakis, M. (1991). Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3), 425\u2013440.","journal-title":"Journal of Computer and System Sciences"},{"key":"1992_CR21","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. (2013). On clique relaxation models in network analysis. European Journal of Operational Research, 226, 9\u201318.","journal-title":"European Journal of Operational Research"},{"key":"1992_CR22","unstructured":"Raghavan, S. (1995). Formulations and algorithms for network design problems with connectivity requirements. PhD thesis, Massachusetts Institute of Technology"},{"key":"1992_CR23","doi-asserted-by":"crossref","unstructured":"Raz, R., & Safra, S. (1997). A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of NP. In Proceedings of the 29th ACM symposium on theory of computing, El Paso (pp. 475\u2013484)","DOI":"10.1145\/258533.258641"},{"key":"1992_CR24","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V. V. (2001). Approximation algorithms. New York: Springer."},{"issue":"2","key":"1992_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.ejor.2014.05.041","volume":"239","author":"A Veremyev","year":"2014","unstructured":"Veremyev, A., Prokopyev, O. A., Boginski, V., & Pasiliao, E. L. (2014). Finding maximum subgraphs with relatively large vertex connectivity. European Journal of Operational Research, 239(2), 349\u2013362.","journal-title":"European Journal of Operational Research"},{"key":"1992_CR26","first-page":"137","volume":"20","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., & Boginski, V. (2012). Robustness and strong attack tolerance of low-diameter networks. Dynamics of Information Systems: Mathematical Foundations. Springer Proceedings in Mathematics & Statistics, 20, 137\u2013156.","journal-title":"Dynamics of Information Systems: Mathematical Foundations. Springer Proceedings in Mathematics & Statistics"},{"key":"1992_CR27","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. (2012). Identifying large robust network clusters via new compact formulations of maximum $$k$$-club problems. European Journal of Operational Research, 218, 316\u2013326.","journal-title":"European Journal of Operational Research"},{"key":"1992_CR28","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.2014.0618","volume":"27","author":"A Verma","year":"2015","unstructured":"Verma, A., Buchanan, A., & Butenko, S. (2015). Solving the maximum clique and vertex coloring problems on very large sparse networks. INFORMS Journal on Computing, 27, 164\u2013177.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"1992_CR29","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/net.20054","volume":"45","author":"J-H Yin","year":"2005","unstructured":"Yin, J.-H., Li, J.-S., Chen, G.-L., & Zhong, C. (2005). On the fault-tolerant diameter and wide diameter of $$\\omega $$-connected graphs. Networks, 45(2), 88\u201394.","journal-title":"Networks"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1992-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1992-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1992-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1992-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T19:19:26Z","timestamp":1691954366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1992-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,4]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["1992"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1992-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2015,9,4]]},"assertion":[{"value":"4 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}