{"id":"https://openalex.org/W1526404960","doi":"https://doi.org/10.1145/2746226","title":"Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets","display_name":"Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets","publication_year":2015,"publication_date":"2015-11-16","ids":{"openalex":"https://openalex.org/W1526404960","doi":"https://doi.org/10.1145/2746226","mag":"1526404960"},"language":"en","primary_location":{"id":"doi:10.1145/2746226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746226","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","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/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA","Carnegie-Mellon University, Pittsburgh, PA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, PA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078381067"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.4554,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.82168183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"21"},"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.9994000196456909,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9019875526428223},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.901362419128418},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7491742968559265},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6206921339035034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5974690914154053},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5426040887832642},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49048468470573425},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4697433114051819},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.4520620107650757},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4400297999382019},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4144710898399353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3384628891944885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2974926829338074}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9019875526428223},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.901362419128418},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7491742968559265},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6206921339035034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5974690914154053},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5426040887832642},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49048468470573425},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4697433114051819},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.4520620107650757},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4400297999382019},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4144710898399353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3384628891944885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2974926829338074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2746226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746226","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.757.8832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.757.8832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1012.4962.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1482106463","https://openalex.org/W1503396090","https://openalex.org/W1579892319","https://openalex.org/W1604332079","https://openalex.org/W1680189815","https://openalex.org/W1973444128","https://openalex.org/W1975162826","https://openalex.org/W1989453388","https://openalex.org/W1993119087","https://openalex.org/W2000444555","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2020066367","https://openalex.org/W2021185572","https://openalex.org/W2029437526","https://openalex.org/W2033885045","https://openalex.org/W2037408498","https://openalex.org/W2042276676","https://openalex.org/W2044343300","https://openalex.org/W2055037276","https://openalex.org/W2064933851","https://openalex.org/W2074121653","https://openalex.org/W2076901012","https://openalex.org/W2081254453","https://openalex.org/W2109309418","https://openalex.org/W2113437680","https://openalex.org/W2114752827","https://openalex.org/W2117399775","https://openalex.org/W2131116400","https://openalex.org/W2132651631","https://openalex.org/W2134396776","https://openalex.org/W2140118062","https://openalex.org/W2340149117","https://openalex.org/W2483532815","https://openalex.org/W2757107770","https://openalex.org/W3030774092","https://openalex.org/W3153460966","https://openalex.org/W4245047469","https://openalex.org/W4251616545"],"related_works":["https://openalex.org/W4385627918","https://openalex.org/W4252399622","https://openalex.org/W4235430592","https://openalex.org/W4320232260","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2506304636","https://openalex.org/W1678097331","https://openalex.org/W2169286758","https://openalex.org/W1497312391"],"abstract_inverted_index":{"Consider":[0],"the":[1,24,30,37,53,69,76,113,158,193],"following":[2],"problem:":[3],"given":[4,118,197],"a":[5,64,120,162],"set":[6,31,49,70,114],"system":[7,115],"(":[8,18],"U":[9,19,27],",":[10,20,28],"\u03a9)":[11],"and":[12,174,178,201],"an":[13,61],"edge-weighted":[14],"graph":[15],"G":[16],"=":[17],"E":[21],")":[22],"on":[23],"same":[25],"universe":[26],"find":[29,68],"A":[32,43,71],"\u2208":[33,72],"\u03a9":[34,51,73,116],"such":[35,74],"that":[36,75,93,98,152],"Steiner":[38],"tree":[39],"cost":[40],"with":[41],"terminals":[42],"is":[44,52,60,83,117,130],"as":[45,47,84,86,161],"large":[46,85],"possible\u2014\u201cwhich":[48],"in":[50],"most":[54],"difficult":[55],"to":[56,132],"connect":[57],"up?\u201d":[58],"This":[59,128],"example":[62],"of":[63,78,137,157,186],"max-min":[65,110,172],"problem":[66,82],":":[67],"value":[77],"some":[79],"minimization":[80],"(covering)":[81],"possible.":[87],"In":[88],"this":[89],"article,":[90],"we":[91,104,150,167],"show":[92,151],"for":[94,109,134,164,183,190],"certain":[95],"covering":[96,143,188],"problems":[97,144],"admit":[99],"good":[100,107],"deterministic":[101],"online":[102,159],"algorithms,":[103],"can":[105,154],"give":[106,168,180],"algorithms":[108,182],"optimization":[111,173],"when":[112],"by":[119,198],"p":[121,199],"-system":[122],"or":[123,126],"knapsack":[124,202],"constraints":[125],"both.":[127],"result":[129],"similar":[131],"results":[133],"constrained":[135],"maximization":[136],"submodular":[138],"functions.":[139],"Although":[140],"many":[141],"natural":[142],"are":[145,196],"not":[146],"even":[147],"approximately":[148],"submodular,":[149],"one":[153],"use":[155],"properties":[156],"algorithm":[160],"surrogate":[163],"submodularity.":[165],"Moreover,":[166],"stronger":[169],"connections":[170],"between":[171],"two-stage":[175],"robust":[176,184],"optimization,":[177],"hence":[179],"improved":[181],"versions":[185],"various":[187],"problems,":[189],"cases":[191],"where":[192],"uncertainty":[194],"sets":[195],"-systems":[200],"constraints.":[203]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}