{"id":"https://openalex.org/W7118678600","doi":"https://doi.org/10.1137/1.9781611978971.203","title":"Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More","display_name":"Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118678600","doi":"https://doi.org/10.1137/1.9781611978971.203"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.203","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.203","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103305934","display_name":"Rishi Chandra","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rishi Chandra","raw_affiliation_strings":["Johns Hopkins University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103305936","display_name":"Chenglin Fan","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chenglin Fan","raw_affiliation_strings":["Seoul National University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088656303","display_name":"Zongrui Zou","orcid":"https://orcid.org/0000-0001-5224-9586"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zongrui Zou","raw_affiliation_strings":["Nanjing University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5688","last_page":"5728"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.7817000150680542,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.7817000150680542,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.15369999408721924,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.02850000001490116,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.9387999773025513},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.795199990272522},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.510699987411499},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.49559998512268066},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4666999876499176},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42570000886917114},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.39430001378059387},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.3928999900817871}],"concepts":[{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.9387999773025513},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.795199990272522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6126999855041504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.554099977016449},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.510699987411499},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.49559998512268066},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4666999876499176},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.397599995136261},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.39430001378059387},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3515999913215637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35019999742507935},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C203223496","wikidata":"https://www.wikidata.org/wiki/Q4681344","display_name":"Additive model","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.203","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.203","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,192],"paper,":[2],"we":[3,43,147,196],"address":[4],"the":[5,11,19,23,45,73,97,112,126,135,143,153,159,166],"challenge":[6],"of":[7,13,111,161,174,214],"differential":[8],"privacy":[9,113,181],"in":[10,109],"context":[12],"graph":[14],"cuts,":[15],"specifically":[16],"focusing":[17],"on":[18,96,158],"multiway":[20,41],"cut":[21],"and":[22,128],"minimum":[24,144],"\\(k\\)-cut.":[25],"We":[26,88,183],"introduce":[27],"edge-differentially":[28],"private":[29,52,64,80,123,168,200],"algorithms":[30,81,138],"that":[31,71,82,101,190],"achieve":[32],"nearly":[33],"optimal":[34,108,171],"performance":[35],"for":[36,51,102,125,139,203],"these":[37,140],"problems.":[38,55],"Motivated":[39],"by":[40,134],"cut,":[42],"propose":[44],"shifting":[46,116],"mechanism,":[47],"a":[48,67,91,149,179,207],"general":[49],"framework":[50,57],"combinatorial":[53],"optimization":[54],"This":[56],"allows":[58,119],"us":[59,120],"to":[60,121,164],"develop":[61],"an":[62,186,198,211],"efficient":[63,199],"algorithm":[65,106,124,169,201],"with":[66,131,156,170,210],"multiplicative":[68,86],"approximation":[69],"ratio":[70],"matches":[72,191],"state-of-the-art":[74],"non-private":[75],"algorithm,":[76],"improving":[77],"over":[78],"previous":[79],"have":[83],"provably":[84],"worse":[85],"loss.":[87],"then":[89],"provide":[90,197],"tight":[92],"information-theoretic":[93,187],"lower":[94,188],"bound":[95,189],"additive":[98,172,193,212],"error,":[99],"demonstrating":[100],"constant":[103],"\\(k\\),":[104,205],"our":[105],"is":[107],"terms":[110],"cost.":[114],"The":[115],"mechanism":[117,155],"also":[118,184],"design":[122],"multicut":[127],"max-cut":[129],"problems,":[130],"runtimes":[132],"determined":[133],"best":[136],"nonprivate":[137],"tasks.":[141],"For":[142],"\\(k\\)-cut":[145],"problem":[146],"use":[148],"different":[150],"approach,":[151],"combining":[152],"exponential":[154],"bounds":[157],"number":[160],"approximate":[162],"\\(k\\)-cuts":[163],"get":[165],"first":[167],"error":[173,213],"\\(O(k":[175],"\\log":[176],"n)\\)":[177],"(for":[178],"fixed":[180],"parameter).":[182],"establish":[185],"error.":[194],"Furthermore,":[195],"even":[202],"non-constant":[204],"including":[206],"polynomial-time":[208],"2-approximation":[209],"\\(\\tilde":[215],"O(k^{1.5})\\).":[216]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-08T00:00:00"}