{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T19:40:51Z","timestamp":1778010051140,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642222993","type":"print"},{"value":"9783642223006","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_53","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"631-641","source":"Crossref","is-referenced-by-count":4,"title":["PTAS for Densest k-Subgraph in Interval Graphs"],"prefix":"10.1007","author":[{"given":"Tim","family":"Nonner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"53_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"53_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D.R., Karpinski, M.: Polynomial time approximation schemes for dense instances of np-hard problems. J. Comput. Syst. Sci.\u00a058(1), 193\u2013210 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y. Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms\u00a034(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"issue":"16","key":"53_CR4","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ipl.2010.05.011","volume":"110","author":"J. Backer","year":"2010","unstructured":"Backer, J., Keil, J.M.: Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs. Inf. Process. Lett.\u00a0110(16), 635\u2013638 (2010)","journal-title":"Inf. Process. Lett."},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an O(n 1\/4) -approximation for densest k-subgraph. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 201\u2013210 (2010)","DOI":"10.1145\/1806689.1806719"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-18318-8_8","volume-title":"Approximation and Online Algorithms","author":"D.Z. Chen","year":"2011","unstructured":"Chen, D.Z., Fleischer, R., Li, J.: Densest k-subgraph approximation on intersection graphs. In: Jansen, K., Solis-Oba, R. (eds.) WAOA 2010. LNCS, vol.\u00a06534, pp. 83\u201393. Springer, Heidelberg (2011)"},{"issue":"2","key":"53_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms\u00a041(2), 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"issue":"3","key":"53_CR8","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"53_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance Graphs. Cambridge University Press, Cambridge (2004)"},{"key":"53_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6schel","year":"1988","unstructured":"Gr\u00f6schel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"key":"53_CR11","doi-asserted-by":"crossref","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM\u00a022 (1975)","DOI":"10.1145\/321906.321909"},{"issue":"4","key":"53_CR12","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539705447037","volume":"36","author":"S. Khot","year":"2006","unstructured":"Khot, S.: Ruling out ptas for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput.\u00a036(4), 1025\u20131071 (2006)","journal-title":"SIAM J. Comput."},{"key":"53_CR13","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 1993), pp. 692\u2013701 (1993)","DOI":"10.1109\/SFCS.1993.366818"},{"key":"53_CR14","volume-title":"Combinatorial optimization - networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial optimization - networks and matroids. Holt, Rinehart and Winston, New York (1976)"},{"issue":"4","key":"53_CR15","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10878-007-9069-1","volume":"14","author":"M. Liazi","year":"2007","unstructured":"Liazi, M., Milis, I., Pascual, F., Zissimopoulos, V.: The densest k-subgraph problem on clique graphs. J. Comb. Optim.\u00a014(4), 465\u2013474 (2007)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"53_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ipl.2008.03.016","volume":"108","author":"M. Liazi","year":"2008","unstructured":"Liazi, M., Milis, I., Zissimopoulos, V.: A constant approximation algorithm for the densest k-subgraph problem on chordal graphs. Inf. Process. Lett.\u00a0108(1), 29\u201332 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"53_CR17","doi-asserted-by":"publisher","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. Discrete Applied Mathematics\u00a09(1), 27\u201339 (1984)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:54:15Z","timestamp":1560466455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}