{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T16:41:26Z","timestamp":1790268086799,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,14]],"date-time":"2009-06-14T00:00:00Z","timestamp":1244937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004965","name":"Sixth Framework Programme","doi-asserted-by":"publisher","award":["IST 027978"],"award-info":[{"award-number":["IST 027978"]}],"id":[{"id":"10.13039\/501100004965","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,6,14]]},"DOI":"10.1145\/1553374.1553473","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T09:34:36Z","timestamp":1245144876000},"page":"769-776","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Solution stability in linear programming relaxations"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Nowozin","sequence":"first","affiliation":[{"name":"Max Planck Institute for Biological Cybernetics, T\u00fcbingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefanie","family":"Jegelka","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Biological Cybernetics, T\u00fcbingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652189"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/548834"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190689"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581239"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.008"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2778766.2778779"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04295-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_21"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102379"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72870-2_2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217303"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3112655.3112849"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580870"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5561-9_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102400"},{"key":"e_1_3_2_1_16_1","volume-title":"An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 291--307","author":"Kernighan B. W.","year":"1970","unstructured":"Kernighan, B. W., & Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 291--307."},{"key":"e_1_3_2_1_17_1","volume-title":"echnical Report). Gatech.","author":"Kilin\u00e7-Karzan F.","year":"2007","unstructured":"Kilin\u00e7-Karzan, F., Toriello, A., Ahmed, S., Nemhauser, G., & Savelsbergh, M. (2007). Approximating the stability region for binary mixed-integer programs (Technical Report). Gatech."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056131"},{"key":"e_1_3_2_1_19_1","volume-title":"Finding and evaluating community structure in networks. Physical Review E, 69","author":"Newman M. E. J.","year":"2004","unstructured":"Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482356"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/17634"},{"key":"e_1_3_2_1_22_1","volume-title":"Integer programming","author":"Wolsey L. A.","year":"1998","unstructured":"Wolsey, L. A. (1998). Integer programming. John Wiley."}],"event":{"name":"ICML '09: The 26th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Montreal Quebec Canada","acronym":"ICML '09","sponsor":["MITACS","Microsoft Research Microsoft Research","NSF"]},"container-title":["Proceedings of the 26th Annual International Conference on Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553473","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1553374.1553473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T19:55:06Z","timestamp":1779047706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553473"}},"subtitle":["graph partitioning and unsupervised learning"],"short-title":[],"issued":{"date-parts":[[2009,6,14]]},"references-count":22,"alternative-id":["10.1145\/1553374.1553473","10.1145\/1553374"],"URL":"https:\/\/doi.org\/10.1145\/1553374.1553473","relation":{},"subject":[],"published":{"date-parts":[[2009,6,14]]},"assertion":[{"value":"2009-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}