{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T19:51:03Z","timestamp":1775850663739,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T00:00:00Z","timestamp":1415836800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00453-014-9956-7","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T17:10:25Z","timestamp":1415985025000},"page":"528-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["PTAS for Densest $$k$$ k -Subgraph in Interval Graphs"],"prefix":"10.1007","volume":"74","author":[{"given":"Tim","family":"Nonner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"1","key":"9956_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"Y Perl","year":"1984","unstructured":"Perl, Y., Corneil, D.G.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27\u201339 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"9956_CR2","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"Subhash Khot","year":"2006","unstructured":"Khot, Subhash: Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput. 36(4), 1025\u20131071 (2006)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9956_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ipl.2008.03.016","volume":"108","author":"Maria Liazi","year":"2008","unstructured":"Liazi, Maria, Milis, Ioannis, Zissimopoulos, Vassilis: A constant approximation algorithm for the densest k-subgraph problem on chordal graphs. Inf. Process. Lett. 108(1), 29\u201332 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9956_CR4","volume-title":"Combinatorial Optimization\u2014Networks and Matroids","author":"Eugene L Lawler","year":"1976","unstructured":"Lawler, Eugene L.: Combinatorial Optimization\u2014Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"9956_CR5","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: On choosing a dense subgraph. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS\u201993), pp. 692\u2013701 (1993)","DOI":"10.1109\/SFCS.1993.366818"},{"issue":"3","key":"9956_CR6","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"Uriel Feige","year":"2001","unstructured":"Feige, Uriel, Peleg, David, Kortsarz, Guy: The dense k-subgraph problem. Algorithmica 29(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"9956_CR7","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an $$ {O}(n^{1\/4}) $$ O ( n 1 \/ 4 ) -approximation for densest k-subgraph. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC\u201910), pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"issue":"2","key":"9956_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Yuichi Asahiro","year":"2000","unstructured":"Asahiro, Yuichi, Iwama, Kazuo, Tamaki, Hisao, Tokuyama, Takeshi: Greedily finding a dense subgraph. J. Algorithms 34(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"issue":"2","key":"9956_CR9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"Uriel Feige","year":"2001","unstructured":"Feige, Uriel, Langberg, Michael: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms 41(2), 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"issue":"1","key":"9956_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"Sanjeev Arora","year":"1999","unstructured":"Arora, Sanjeev, Karger, David R., Karpinski, Marek: Polynomial time approximation schemes for dense instances of np-hard problems. J. Comput. Syst. Sci. 58(1), 193\u2013210 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"9956_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimizatio","author":"M Gr\u00f6schel","year":"1988","unstructured":"Gr\u00f6schel, M., Lov\u00e1sz, L\u00e1szl\u00f3, Schrijver, Alexander: Geometric Algorithms and Combinatorial Optimizatio. Springer, New York (1988)"},{"key":"9956_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"Martin Charles Golumbic","year":"2004","unstructured":"Golumbic, Martin Charles, Trenk, Ann N.: Tolerance Graphs. Cambridge University Press, Cambridge (2004)"},{"issue":"4","key":"9956_CR13","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10878-007-9069-1","volume":"14","author":"Maria Liazi","year":"2007","unstructured":"Liazi, Maria, Milis, Ioannis, Pascual, Fanny, Zissimopoulos, Vassilis: The densest k-subgraph problem on clique graphs. J. Comb. Optim. 14(4), 465\u2013474 (2007)","journal-title":"J. Comb. Optim."},{"key":"9956_CR14","doi-asserted-by":"crossref","unstructured":"Chen, D.Z., Fleischer, R., Li, J.: Densest k-subgraph approximation on intersection graphs. In Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA\u201910), pp. 83\u201393 (2010)","DOI":"10.1007\/978-3-642-18318-8_8"},{"issue":"16","key":"9956_CR15","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.ipl.2010.05.011","volume":"110","author":"Jonathan Backer","year":"2010","unstructured":"Backer, Jonathan, Mark Keil, J.: Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs. Inf. Process. Lett. 110(16), 635\u2013638 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"9956_CR16","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"Sanjeev Arora","year":"1998","unstructured":"Arora, Sanjeev: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"9956_CR17","doi-asserted-by":"crossref","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463\u2013468 (1975)","DOI":"10.1145\/321906.321909"},{"key":"9956_CR18","doi-asserted-by":"crossref","unstructured":"Watrigant, R., Bougeret, M., Giroudeau, R.: Approximating the sparsest k-subgraph in chordal graphs. In Proceedings of the 11th Workshop on Approximation and Online Algorithms (WAOA\u201913) (2013)","DOI":"10.1007\/978-3-319-08001-7_7"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9956-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9956-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9956-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T10:51:16Z","timestamp":1566039076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9956-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9956"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9956-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]}}}