{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:17Z","timestamp":1725549497982},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_29","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"348-359","source":"Crossref","is-referenced-by-count":3,"title":["Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract"],"prefix":"10.1007","author":[{"given":"Gerold","family":"J\u00e4ger","sequence":"first","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/S089548010036813X","volume":"14","author":"A. Ageev","year":"2001","unstructured":"Ageev, A., Hassin, R., Sviridenko, M.: A 0.5\u2013Approximation Algorithm for MAX DICUT with Given Sizes of Parts. SIAM Journal on Discrete Mathematics\u00a014(2), 246\u2013255 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Ageev","year":"1999","unstructured":"Ageev, A., Sviridenko, M.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 17\u201330. Springer, Heidelberg (1999)"},{"key":"29_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. Journal of Algorithms\u00a034, 203\u2013221 (2000)","journal-title":"Journal of Algorithms"},{"key":"29_CR4","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"D. Bertsimas","year":"1998","unstructured":"Bertsimas, D., Ye, Y.: Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics. In: Handbook of Combinatorial Optimization, vol.\u00a03, pp. 1\u201319. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"29_CR5","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. Journal of Algorithms\u00a041, 174\u2013211 (2001)","journal-title":"Journal of Algorithms"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Langberg, M.: The $\\mbox{RPR}^2$ rounding technique for semidefinite programs. In: Proceedings of the 33th Annual ACM Symposium on Theory of Computing, Crete, Greece, pp. 213\u2013224 (2001)","DOI":"10.1007\/3-540-48224-5_18"},{"key":"29_CR7","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-Subgraph Problem. Algorithmica\u00a029, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"29_CR8","unstructured":"Feige, U., Seltser, M.: On the densest k-subgraph problem, Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot (September 1997)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica\u00a018, 67\u201381 (1997)","journal-title":"Algorithmica"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/rsa.10035","volume":"20","author":"E. Halperin","year":"2002","unstructured":"Halperin, E., Zwick, U.: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Structures and Algorithms\u00a020(3), 382\u2013402 (2002)","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s101070100288","volume":"92","author":"Q. Han","year":"2002","unstructured":"Han, Q., Ye, Y., Zhang, J.: An Improved Rounding Method and Semidefinite Programming Relaxation for Graph Partition. Mathematical Programming\u00a092(3), 509\u2013535 (2002)","journal-title":"Mathematical Programming"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/S0097539796309326","volume":"28","author":"S. Mahajan","year":"1999","unstructured":"Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing\u00a028, 1641\u20131663 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"#cr-split#-29_CR14.1","doi-asserted-by":"crossref","unstructured":"Srivastav, A., Wolf, K.: Finding Dense Subgraphs with Semidefinite Programming. In: Approximation Algorithms for Combinatorial Optimization 1998, pp. 181\u2013191 (1998);","DOI":"10.1007\/BFb0053974"},{"key":"#cr-split#-29_CR14.2","unstructured":"Erratum, Mathematisches Seminar, Universit\u00e4t zu Kiel, 1999"},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/PL00011415","volume":"90","author":"Y. Ye","year":"2001","unstructured":"Ye, Y.: A.699\u2013approximation algorithm for MAX-Bisection. Mathematical Programming\u00a090(1), 101\u2013111 (2001)","journal-title":"Mathematical Programming"},{"key":"29_CR16","unstructured":"Ye, Y., Zhang, J.: Approximation of Dense- $ \\frac{n}{2} $ -Subgraph and the complement of Min-Bisection, (1999) (unpublished Manuscript)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:51Z","timestamp":1605761931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}