{"id":"https://openalex.org/W1886770168","doi":"https://doi.org/10.1007/978-3-540-72792-7_19","title":"A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization","display_name":"A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization","publication_year":2007,"publication_date":"2007-06-25","ids":{"openalex":"https://openalex.org/W1886770168","doi":"https://doi.org/10.1007/978-3-540-72792-7_19","mag":"1886770168"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72792-7_19","pdf_url":null,"source":{"id":"https://openalex.org/S4306418923","display_name":"Integer Programming and Combinatorial Optimization","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"book-chapter","type_crossref":"book-chapter","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/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Sloan School of Management, MIT, Cambridge, MA, 02139,"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, MIT, Cambridge, MA, 02139,","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5072685560"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.651,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.947487,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"240","last_page":"251"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9999,"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.9999,"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/T10237","display_name":"Cryptography and Data Security","score":0.9987,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9967,"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/submodular-set-function","display_name":"Submodular set function","score":0.9020122},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.52434045},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.4383522}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9020122},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7149255},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.710134},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6344113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.54597515},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.52434045},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5182921},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47757915},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4663443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46627453},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.4383522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35867703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30711508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.273593},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72792-7_19","pdf_url":null,"source":{"id":"https://openalex.org/S4306418923","display_name":"Integer Programming and Combinatorial Optimization","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1498671329","https://openalex.org/W1500921805","https://openalex.org/W1563601717","https://openalex.org/W1576820654","https://openalex.org/W1589196414","https://openalex.org/W2012329067","https://openalex.org/W2015429465","https://openalex.org/W2020165787","https://openalex.org/W2022049946","https://openalex.org/W2035575256","https://openalex.org/W2045687732","https://openalex.org/W2100440346","https://openalex.org/W2128059732","https://openalex.org/W2258857078","https://openalex.org/W2988480584","https://openalex.org/W3171580098","https://openalex.org/W4295016751"],"related_works":["https://openalex.org/W4299305030","https://openalex.org/W4252842032","https://openalex.org/W395484964","https://openalex.org/W2952081610","https://openalex.org/W2113270940","https://openalex.org/W2089134982","https://openalex.org/W2040347389","https://openalex.org/W1983383464","https://openalex.org/W1971979548","https://openalex.org/W1599232611"],"abstract_inverted_index":{"We":[0,18],"consider":[1],"the":[2,36,48],"problem":[3],"of":[4,60],"minimizing":[5],"a":[6,12,20,58],"submodular":[7],"function":[8],"f":[9],"defined":[10],"on":[11],"set":[13],"V":[14],"with":[15],"n":[16,30],"elements.":[17],"give":[19],"combinatorial":[21],"algorithm":[22],"that":[23],"runs":[24],"in":[25],"O(n":[26],"5":[27],"EO":[28,34],"+":[29],"6)":[31],"time,":[32],"where":[33],"is":[35],"time":[37,54],"to":[38],"evaluate":[39],"f(S)":[40],"for":[41],"some":[42],"S":[43],"\u2286":[44],"V.":[45],"This":[46],"improves":[47],"previous":[49],"best":[50],"strongly":[51],"polynomial":[52],"running":[53],"by":[55],"more":[56],"than":[57],"factor":[59],"n.":[61]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1886770168","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2024-12-29T15:13:09.793157","created_date":"2016-06-24"}