{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:26Z","timestamp":1725897746627},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_10","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"109-120","source":"Crossref","is-referenced-by-count":2,"title":["On Quadratic Programming with a Ratio Objective"],"prefix":"10.1007","author":[{"given":"Aditya","family":"Bhaskara","sequence":"first","affiliation":[]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[]},{"given":"Rajsekar","family":"Manokaran","sequence":"additional","affiliation":[]},{"given":"Aravindan","family":"Vijayaraghavan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"206","volume-title":"FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science","author":"S. Arora","year":"2005","unstructured":"Arora, S., Berger, E., Hazan, E., Kindler, G., Safra, M.: On non-approximability for quadratic programs. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 206\u2013215. IEEE Computer Society, Washington, DC (2005)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/S0097539704441629","volume":"35","author":"N. Alon","year":"2006","unstructured":"Alon, N., Naor, A.: Approximating the cut-norm via grothendieck\u2019s inequality. SIAM J. Comput.\u00a035, 787\u2013803 (2006)","journal-title":"SIAM J. Comput."},{"key":"10_CR3","first-page":"307","volume-title":"Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science","author":"P. Austrin","year":"2007","unstructured":"Austrin, P.: Towards sharp inapproximability for any 2-csp. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 307\u2013317. IEEE Computer Society, Washington, DC (2007)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/1806689.1806719","volume-title":"STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing","author":"A. Bhaskara","year":"2010","unstructured":"Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an o(n\n                  1\/4) approximation for densest k-subgraph. In: STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 201\u2013210. ACM, New York (2010)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Manokaran, R., Vijayaraghavan, A.: On quadratic programming with a ratio objective. CoRR, abs\/1101.1710 (2011)","DOI":"10.1007\/978-3-642-31594-7_10"},{"key":"10_CR6","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.\u00a01913, pp. 84\u201395. Springer, Heidelberg (2000)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1132516.1132547","volume-title":"Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006","author":"M. Charikar","year":"2006","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Near-optimal algorithms for unique games. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 205\u2013214. ACM, New York (2006)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/FOCS.2004.39","volume-title":"FOCS 2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science","author":"M. Charikar","year":"2004","unstructured":"Charikar, M., Wirth, A.: Maximizing quadratic programs: Extending grothendieck\u2019s inequality. In: FOCS 2004: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 54\u201360. IEEE Computer Society, Washington, DC (2004)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Kannan, R., Srivastava, N.: Zero-one rounding of singular vectors. Manuscript (2011)","DOI":"10.1007\/978-3-642-31594-7_24"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: Proceedings of the 34th annual ACM Symposium on Theory of Computing (STOC 2002), pp. 534\u2013543. ACM Press (2002)","DOI":"10.1145\/509984.509985"},{"issue":"6","key":"10_CR11","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. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S. Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for max-cut and other 2-variable csps? SIAM J. Comput.\u00a037(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Khot, S., Vishnoi, N.K.: The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into \u21131. In: FOCS 2005, pp. 53\u201362 (2005)","DOI":"10.1145\/2629614"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s101070050100","volume":"86","author":"A. Nemirovski","year":"1999","unstructured":"Nemirovski, A., Roos, C., Terlaky, T.: On maximization of quadratic form over intersection of ellipsoids with common center. Mathematical Programming\u00a086, 463\u2013473 (1999), doi:10.1007\/s101070050100","journal-title":"Mathematical Programming"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? In: STOC 2008, pp. 245\u2013254 (2008)","DOI":"10.1145\/1374376.1374414"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/1806689.1806792","volume-title":"STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing","author":"P. Raghavendra","year":"2010","unstructured":"Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: STOC 2010: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 755\u2013764. ACM, New York (2010)"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/1536414.1536452","volume-title":"STOC 2009: Proceedings of the 41st annual ACM Symposium on Theory of Computing","author":"L. Trevisan","year":"2009","unstructured":"Trevisan, L.: Max cut and the smallest eigenvalue. In: STOC 2009: Proceedings of the 41st annual ACM Symposium on Theory of Computing, pp. 263\u2013272. ACM, New York (2009)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/1536414.1536457","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"M. Tulsiani","year":"2009","unstructured":"Tulsiani, M.: Csp gaps and reductions in the lasserre hierarchy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 303\u2013312. ACM, New York (2009)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:14:47Z","timestamp":1620130487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}