{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:58Z","timestamp":1759638358991,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132594","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"537-546","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Integrality gaps for sparsest cut and minimum linear arrangement problems"],"prefix":"10.1145","author":[{"given":"Nikhil R.","family":"Devanur","sequence":"first","affiliation":[{"name":"Georgia Tech., Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash A.","family":"Khot","sequence":"additional","affiliation":[{"name":"Georgia Tech., Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rishi","family":"Saket","sequence":"additional","affiliation":[{"name":"Georgia Tech., Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[{"name":"IBM India Research Lab, IIT Delhi, New Delhi"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060673"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02785861"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109670"},{"key":"e_1_3_2_1_7_1","first-page":"102","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Chawla Shuchi","year":"2005","unstructured":"Shuchi Chawla , Anupam Gupta , and Harald R\u00e4cke . Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut . In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms , pages 102 -- 111 , 2005 . Shuchi Chawla, Anupam Gupta, and Harald R\u00e4cke. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 102--111, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.20"},{"key":"e_1_3_2_1_9_1","volume-title":"Integrality gaps for sparsest cut and minimum linear arrangement problems. Manuscript available from http:\/\/www.cc.gatech.edu\/?nikhil\/","author":"Devanur Nikhil R","year":"2006","unstructured":"Nikhil R Devanur , Subhash Khot , Rishi Saket , and Nisheeth Vishnoi . Integrality gaps for sparsest cut and minimum linear arrangement problems. Manuscript available from http:\/\/www.cc.gatech.edu\/?nikhil\/ , 2006 . Nikhil R Devanur, Subhash Khot, Rishi Saket, and Nisheeth Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. Manuscript available from http:\/\/www.cc.gatech.edu\/?nikhil\/, 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347478"},{"key":"e_1_3_2_1_11_1","volume-title":"Manuscript","author":"Feige Uriel","year":"2005","unstructured":"Uriel Feige and James Lee . An improved approximation ratio for the minimum linear arrangement problem . Manuscript , 2005 . Uriel Feige and James Lee. An improved approximation ratio for the minimum linear arrangement problem. Manuscript, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614315"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63542"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21923"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.74"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109669"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513441"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1994.365733"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702413197"},{"key":"e_1_3_2_1_22_1","volume-title":"PWS","author":"Shmoys D. B.","year":"1997","unstructured":"D. B. Shmoys . Approximation Algorithms for NP-hard Problems, chapter Approximation algorithms for Cut problems and their application to divide-and-conquer, pages 192--235 . PWS , 1997 . D. B. Shmoys. Approximation Algorithms for NP-hard Problems, chapter Approximation algorithms for Cut problems and their application to divide-and-conquer, pages 192--235. PWS, 1997."}],"event":{"name":"STOC06: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Seattle WA USA","acronym":"STOC06"},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:13Z","timestamp":1750259173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":22,"alternative-id":["10.1145\/1132516.1132594","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132594","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}