{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:20:16Z","timestamp":1648992016376},"reference-count":9,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2006,5,17]],"date-time":"2006-05-17T00:00:00Z","timestamp":1147824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"DOI":"10.1007\/s10878-006-8210-x","type":"journal-article","created":{"date-parts":[[2006,5,22]],"date-time":"2006-05-22T06:21:26Z","timestamp":1148278886000},"source":"Crossref","is-referenced-by-count":0,"title":["A \u201cmaximum node clustering\u201d problem"],"prefix":"10.1007","author":[{"given":"Giuliana","family":"Carello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico Della","family":"Croce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Grosso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"8210_CR1","unstructured":"Billionnet A, Roupin F (2005) A Deterministic Approximation Algorithm for the Densest k-Subgraph Problem, 4OR, forthcoming"},{"key":"8210_CR2","unstructured":"Carello G (2004) Hub Location Problems in Telecommunication Networks, Ph.D. Thesis, Politecnico di Torino available at http:\/\/www.orgroup.polito.it\/members\/carello\/phdthesis.pdf"},{"issue":"1","key":"8210_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil DG, Perl Y (1984) Clustering and domination in perfect graphs. Discrete Applied Mathematics 9(1):27\u201339","journal-title":"Discrete Applied Mathematics"},{"key":"8210_CR4","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige U, Kortsarz G, Peleg D (2001) The Dense k-Subgraph problem. Algorithmica 29:410\u2013421","journal-title":"Algorithmica"},{"key":"8210_CR5","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco"},{"key":"8210_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz E, Sahni S (1974) Computing partitions with applications to the knapsack problem. Journal of the ACM 21:277\u2013292","journal-title":"Journal of the ACM"},{"key":"8210_CR7","volume-title":"Knaps ack Problems\u2014Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knaps ack Problems\u2014Algorithms and Computer Implementations, Wiley, New York"},{"key":"8210_CR8","doi-asserted-by":"crossref","unstructured":"Woeginger GJ (2003) Exact algorithms for NP-hard problems: a survey, In: Juenger M, Reinelt G, Rinaldi G, (eds.) Combinatorial Optimization - Eureka! You shrink! LNCS 2570, Springer, pp. 185\u2013207","DOI":"10.1007\/3-540-36478-1_17"},{"key":"8210_CR9","volume-title":"Co ncentrator Location in Telecommunication Networks","author":"H Yaman","year":"2005","unstructured":"Yaman H (2005) Co ncentrator Location in Telecommunication Networks, Springer, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8210-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-8210-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-8210-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:10Z","timestamp":1559261890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-8210-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,17]]},"references-count":9,"alternative-id":["8210"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-8210-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,17]]}}}