{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:12:27Z","timestamp":1748751147312,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_41","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T09:08:43Z","timestamp":1449652123000},"page":"566-573","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset"],"prefix":"10.1007","author":[{"given":"Wenbin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Lingxi","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Jianxiong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Fufang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Maobin","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-95995-3_3","volume-title":"Algorithms and Models for the Web-Graph","author":"R Andersen","year":"2009","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 25\u201337. Springer, Heidelberg (2009)"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000)"},{"key":"41_CR3","unstructured":"Chen, W., Samatova, N.F., Stallmann, M.F., Hendrix, W.: On size-constrained minimum $$s$$ s - $$t$$ t cut problems and size-constrained dense subgraph problems, submitted to Theoretical Computer Science, under review"},{"key":"41_CR4","unstructured":"Feige, U., Seltser, M.: On the densest k-subgraph problems. Technical report: CS97-16, Department of Applied Mathematics and Computer Science (1997)"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense $$k$$ k -subgraph problem. Algorithmica 29, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M., Tarjan, R.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"41_CR7","unstructured":"Goldberg, A.: Finding a maximum density subgraph, Technical report UCB\/CSB 84\/171, Department of Electrical Engineering and Computer Science, University of California, Berkeley (1984)"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu, H., Yan, X., Huang, Y., et al.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21, 213\u2013221 (2005)","journal-title":"Bioinformatics"},{"key":"41_CR9","unstructured":"Han, Q.M., Ye, Y.Y., Zhang, J.W.: Approximation of Dense- $$k$$ k subgraph, http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.41.1899"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: On choosing a dense subgraph. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 692\u2013701 (1993)","DOI":"10.1109\/SFCS.1993.366818"},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective function. Math. Operat. Res. 4(4), 414\u2013424 (1979)","journal-title":"Math. Operat. Res."},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-12683-3_30","volume-title":"Research in Computational Molecular Biology","author":"B Saha","year":"2010","unstructured":"Saha, B., Hoch, A., Khuller, S., Raschid, L., Zhang, X.-N.: Dense subgraphs with restrictions and applications to gene annotation graphs. In: Berger, B. (ed.) RECOMB 2010. LNCS, vol. 6044, pp. 456\u2013472. Springer, Heidelberg (2010)"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BFb0053974","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"A Srivastav","year":"1998","unstructured":"Srivastav, A., Wolf, K.: Finding dense subgraphs with semidefinite programming. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 181\u2013191. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:17:52Z","timestamp":1748715472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}