{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:47:03Z","timestamp":1648745223835},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,24]],"date-time":"2014-12-24T00:00:00Z","timestamp":1419379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10878-014-9824-z","type":"journal-article","created":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T10:24:02Z","timestamp":1419330242000},"page":"1298-1315","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chromatic kernel and its applications"],"prefix":"10.1007","volume":"31","author":[{"given":"Hu","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Branislav","family":"Stojkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihe","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Hughes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Fritz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitasha","family":"Sehgal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Berezney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,24]]},"reference":[{"key":"9824_CR1","volume-title":"The probabilistic method","author":"N Alon","year":"1992","unstructured":"Alon N, Spencer JH (1992) The probabilistic method. Wiley, New Jersey"},{"issue":"4","key":"9824_CR2","first-page":"60","volume":"6","author":"R Andersen","year":"2010","unstructured":"Andersen R (2010) A local algorithm for finding dense subgraphs. ACM Trans Algoritm 6(4):60","journal-title":"ACM Trans Algoritm"},{"key":"9824_CR3","doi-asserted-by":"crossref","unstructured":"Arora S, Karger DR, Karpinski M (1995) Polynomial time approximation schemes for dense instances of NP-hard problems. STOC 284\u2013293","DOI":"10.1145\/225058.225140"},{"key":"9824_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: a modern approach","author":"S Arora","year":"2009","unstructured":"Arora S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press, Cambridge"},{"key":"9824_CR5","doi-asserted-by":"crossref","unstructured":"Asahiro Y, Iwama K, Tamaki H, Tokuyama T (1996) Greedily finding a dense subgraph. SWAT\u201996, pp 136\u2013148","DOI":"10.1007\/3-540-61422-2_127"},{"issue":"1\u20133","key":"9824_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal N, Blum A, Chawla S (2004) Correlation clustering. Mach Learn 56(1\u20133):89\u2013113","journal-title":"Mach Learn"},{"key":"9824_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0065-2571(01)00041-3","volume":"42","author":"R Berezney","year":"2002","unstructured":"Berezney R (2002) Regulating the mammalian genome: the role of nuclear architecture. Adv Enzym Regul 42:39\u201352","journal-title":"Adv Enzym Regul"},{"key":"9824_CR8","doi-asserted-by":"crossref","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. APPROX, pp 84\u201395","DOI":"10.1007\/3-540-44436-X_10"},{"issue":"4","key":"9824_CR9","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/ijoc.1040.0096","volume":"16","author":"B Chazelle","year":"2004","unstructured":"Chazelle B, Kingsford C, Singh M (2004) A semidefinite programming approach to side chain positioning with new rounding strategies. INFORMS J Comput 16(4):380\u2013392","journal-title":"INFORMS J Comput"},{"key":"9824_CR10","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kumar R, Pandey S, Vassilvitskii S (2010) Finding the Jaccard median. SODA 293\u2013311","DOI":"10.1137\/1.9781611973075.25"},{"key":"9824_CR11","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1038\/35066075","volume":"2","author":"T Cremer","year":"2001","unstructured":"Cremer T (2001) Chromosome territories, nuclear architecture and gene regulation in mamalian cells. Nat Rev Genet 2:292\u2013301","journal-title":"Nat Rev Genet"},{"key":"9824_CR12","doi-asserted-by":"crossref","unstructured":"Ding H, Xu J (2011) Solving the chromatic cone clustering problem via mini- mum spanning sphere, ICALP\u201911, 4\u20138, Switzerland","DOI":"10.1007\/978-3-642-22006-7_65"},{"key":"9824_CR13","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"1997","unstructured":"Feige U, Kortsarz G, Peleg D (1997) The dense k-subgraph problem. Algorithmica 29:410\u2013421","journal-title":"Algorithmica"},{"key":"9824_CR14","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. Tech Rep"},{"issue":"4","key":"9824_CR15","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J Hastad","year":"2001","unstructured":"Hastad J (2001) Some optimal inapproximability results. J ACM 48(4):798\u2013859","journal-title":"J ACM"},{"key":"9824_CR16","first-page":"597","volume":"1","author":"S Khuller","year":"2009","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs. ICALP 1:597\u2013608","journal-title":"ICALP"},{"issue":"7","key":"9824_CR17","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1093\/bioinformatics\/bti144","volume":"21","author":"C Kingsford","year":"2005","unstructured":"Kingsford C, Chazelle B, Singh M (2005) Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 21(7):1028\u20131039","journal-title":"Bioinformatics"},{"issue":"1","key":"9824_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10878-008-9184-7","volume":"17","author":"L Mukherjee","year":"2009","unstructured":"Mukherjee L, Singh V, Peng J, Xu J, Zeitz M, Berezney R (2009) Generalized median graphs: theory and applications. JCO 17(1):21\u201344","journal-title":"JCO"},{"key":"9824_CR19","first-page":"530","volume":"2","author":"B Stojkovic","year":"2010","unstructured":"Stojkovic B, Zhu Y, Xu J, Fritz A, Zeitz MJ, Vecerova J, Berezney R (2010) Computing maximum association graph in microscopic nucleus images. MICCAI 2:530\u2013537","journal-title":"MICCAI"},{"key":"9824_CR20","doi-asserted-by":"crossref","unstructured":"Trevisan L, Sorkin G, Sudan M, Williamson D (2000) Gadgets, approximation, and linear programming. SIAM J Comput 29(6):2074\u20132097","DOI":"10.1137\/S0097539797328847"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9824-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9824-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9824-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T05:40:47Z","timestamp":1598593247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9824-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,24]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9824"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9824-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,24]]}}}