{"id":"https://openalex.org/W2411775271","doi":"https://doi.org/10.1145/2897518.2897578","title":"Enumerating parametric global minimum cuts by random interleaving","display_name":"Enumerating parametric global minimum cuts by random interleaving","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2411775271","doi":"https://doi.org/10.1145/2897518.2897578","mag":"2411775271"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897578","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897578","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897578&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2897578&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.0454,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.79263936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"542","last_page":"555"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6843211054801941},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.6717332601547241},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6352633237838745},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.6244688630104065},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.47196802496910095},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4561336636543274},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42905110120773315},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.42500990629196167},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4217727780342102},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4172830879688263},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4153205156326294},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4008299708366394},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4000517427921295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3298134207725525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20369410514831543},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0758921205997467}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6843211054801941},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.6717332601547241},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6352633237838745},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.6244688630104065},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.47196802496910095},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4561336636543274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42905110120773315},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.42500990629196167},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4217727780342102},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4172830879688263},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4153205156326294},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4008299708366394},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4000517427921295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3298134207725525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20369410514831543},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0758921205997467},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2897518.2897578","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897578","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897578&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2897518.2897578","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897578","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897578&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7234830010","display_name":null,"funder_award_id":"1117381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2411775271.pdf","grobid_xml":"https://content.openalex.org/works/W2411775271.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1496921672","https://openalex.org/W1513400187","https://openalex.org/W1964510837","https://openalex.org/W1978676170","https://openalex.org/W1998230386","https://openalex.org/W2006742819","https://openalex.org/W2009339416","https://openalex.org/W2011047736","https://openalex.org/W2011297770","https://openalex.org/W2028747718","https://openalex.org/W2045430818","https://openalex.org/W2080654168","https://openalex.org/W2100440346","https://openalex.org/W2104410402","https://openalex.org/W2132147722","https://openalex.org/W2138304862","https://openalex.org/W2149906774","https://openalex.org/W2168919539","https://openalex.org/W2751862591","https://openalex.org/W2753908209","https://openalex.org/W4242246215"],"related_works":["https://openalex.org/W2942946217","https://openalex.org/W2129497110","https://openalex.org/W2594460529","https://openalex.org/W1588356204","https://openalex.org/W2594812523","https://openalex.org/W2587918","https://openalex.org/W2511878883","https://openalex.org/W2162366888","https://openalex.org/W2186701437","https://openalex.org/W1921478398"],"abstract_inverted_index":{"Recently,":[0],"Aissi":[1],"et":[2],"al.":[3],"gave":[4],"new":[5],"counting":[6],"and":[7,29,98],"algorithmic":[8],"bounds":[9,49,71],"for":[10,59],"parametric":[11,83,111],"minimum":[12,33,112],"cuts":[13,31],"in":[14],"a":[15,22,51,65,99,106],"graph,":[16],"where":[17],"each":[18],"edge":[19],"cost":[20,27],"is":[21],"linear":[23,39],"combination":[24,40],"of":[25,37,85],"multiple":[26],"criteria":[28],"different":[30],"become":[32],"as":[34],"the":[35,38,74,90],"coefficients":[36],"are":[41],"varied.":[42],"In":[43],"this":[44],"article,":[45],"we":[46],"derive":[47],"better":[48],"using":[50],"mathematically":[52],"simpler":[53],"argument.":[54],"We":[55,63,103],"provide":[56],"faster":[57],"algorithms":[58],"enumerating":[60],"these":[61],"cuts.":[62,113],"give":[64,105],"lower":[66],"bound":[67],"showing":[68],"our":[69],"upper":[70],"have":[72],"roughly":[73],"right":[75],"degree.":[76],"Our":[77],"results":[78],"also":[79,104],"immediately":[80],"generalize":[81],"to":[82,109],"versions":[84],"other":[86],"problems":[87],"solved":[88],"by":[89],"Contraction":[91],"Algorithm,":[92],"including":[93],"approximate":[94],"min-cuts,":[95],"multi-way":[96],"cuts,":[97],"matroid":[100],"optimization":[101],"problem.":[102],"first":[107],"generalization":[108],"nonlinear":[110]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}