{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:45:33Z","timestamp":1766087133456,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T00:00:00Z","timestamp":1474416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["ERC-2014-CoG 647557"],"award-info":[{"award-number":["ERC-2014-CoG 647557"]}]},{"name":"Royal Society Wolfson Research Merit Award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2017,1,31]]},"abstract":"<jats:p>In computing, as in many aspects of life, changes incur cost. Many optimization problems are formulated as a one-time instance starting from scratch. However, a common case that arises is when we already have a set of prior assignments and must decide how to respond to a new set of constraints, given that each change from the current assignment comes at a price. That is, we would like to maximize the fitness or efficiency of our system, but we need to balance it with the changeout cost from the previous state.<\/jats:p>\n          <jats:p>\n            We provide a precise formulation for this tradeoff and analyze the resulting\n            <jats:italic>stable extensions<\/jats:italic>\n            of some fundamental problems in measurement and analytics. Our main technical contribution is a stable extension of Probability Proportional to Size (PPS) weighted random sampling, with applications to monitoring and anomaly detection problems. We also provide a general framework that applies to top-\n            <jats:italic>k<\/jats:italic>\n            , minimum spanning tree, and assignment. In both cases, we are able to provide exact solutions and discuss efficient incremental algorithms that can find new solutions as the input changes.\n          <\/jats:p>","DOI":"10.1145\/2963103","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T13:13:56Z","timestamp":1474463636000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Tradeoff between Stability and Fit"],"prefix":"10.1145","volume":"13","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel and Google Research"}]},{"given":"Graham","family":"Cormode","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, UK"}]},{"given":"Nick","family":"Duffield","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University, TX, College Station TX, USA"}]},{"given":"Carsten","family":"Lund","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs-Research, NJ, Bedminster, NJ"}]}],"member":"320","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796402"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066171"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146588"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-842X.1972.tb00899.x"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/10079817X"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.006"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240306"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322391"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700375"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90078-X"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90026-3"},{"volume-title":"Proc. of the Second Berkeley Symposium on Mathematical Statistics and Probability","author":"Kuhn H. W.","key":"e_1_2_1_16_1","unstructured":"H. W. Kuhn and A. W. Tucker . 1951. Nonlinear programming . In Proc. of the Second Berkeley Symposium on Mathematical Statistics and Probability . University of California Press, Berkeley, CA, 481--492. H. W. Kuhn and A. W. Tucker. 1951. Nonlinear programming. In Proc. of the Second Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, CA, 481--492."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"e_1_2_1_18_1","unstructured":"P. Sankowski. 2007. Faster dynamic matchings and vertex connectivity. In SODA. 118--126.   P. Sankowski. 2007. Faster dynamic matchings and vertex connectivity. In SODA. 118--126."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4378-6"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_52"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1404-4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2963103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2963103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:04Z","timestamp":1750222444000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2963103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,21]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1,31]]}},"alternative-id":["10.1145\/2963103"],"URL":"https:\/\/doi.org\/10.1145\/2963103","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2016,9,21]]},"assertion":[{"value":"2014-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}