{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:48Z","timestamp":1772893008625,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060675","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"573-581","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":81,"title":["O(\u221alog n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems"],"prefix":"10.1145","author":[{"given":"Amit","family":"Agarwal","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}]},{"given":"Konstantin","family":"Makarychev","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}]},{"given":"Yury","family":"Makarychev","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060673"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_4_1","first-page":"122","volume-title":"Families of Vectors and Probabilistic Combinatorics","author":"Bollob\u00e1s B.","year":"1986","unstructured":"B. Bollob\u00e1s . Combinatorics : Set Systems, Hypergraphs , Families of Vectors and Probabilistic Combinatorics , pages 122 -- 130 . 1986 . B. Bollob\u00e1s. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics, pages 122--130. 1986."},{"key":"e_1_3_2_1_5_1","volume-title":"Improved approximation algorithms for vertex ordering problems. In manuscript","author":"Charikar M.","year":"2004","unstructured":"M. Charikar , H. Karloff , and S. Rao . Improved approximation algorithms for vertex ordering problems. In manuscript , 2004 . M. Charikar, H. Karloff, and S. Rao. Improved approximation algorithms for vertex ordering problems. In manuscript, 2004."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Chawla S.","year":"2005","unstructured":"S. Chawla , A. Gupta , and H. R\u00e4cke . Approximations for generalized sparsest cut and embeddings of l2 into l1 . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2005 . S. Chawla, A. Gupta, and H. R\u00e4cke. Approximations for generalized sparsest cut and embeddings of l2 into l1. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_18"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1987-0871675-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167266"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90058-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799349948"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0833"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300004903"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Lee J. R.","year":"2005","unstructured":"J. R. Lee . On distance scales, embeddings, and efficient relaxations of the cut cone . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , 2005 . J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90023-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019426560X"}],"event":{"name":"STOC05: Symposium on Theory of Computing","location":"Baltimore MD USA","acronym":"STOC05","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060675","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:28:11Z","timestamp":1673166491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":18,"alternative-id":["10.1145\/1060590.1060675","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060675","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}