{"id":"https://openalex.org/W4413071367","doi":"https://doi.org/10.1007/978-3-031-98740-3_27","title":"Recoverable Robust Cardinality Constrained Maximization with\u00a0Commitment of\u00a0a\u00a0Submodular Function","display_name":"Recoverable Robust Cardinality Constrained Maximization with\u00a0Commitment of\u00a0a\u00a0Submodular Function","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4413071367","doi":"https://doi.org/10.1007/978-3-031-98740-3_27"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-98740-3_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-98740-3_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00542-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080260380","display_name":"Sandra M\u00fcnch","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sabine M\u00fcnch","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0000-7540-7401","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035984317","display_name":"Stephen Raach","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stephen Raach","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102921808","display_name":"Sven de Vries","orcid":"https://orcid.org/0000-0002-2440-4937"},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sven de Vries","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2440-4937","affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":2.512,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.86767711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"63","issue":"3","first_page":"376","last_page":"390"},"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.9998999834060669,"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.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8684080839157104},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.8463979959487915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7215539216995239},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6156061291694641},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5646482706069946},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.520169734954834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3356972336769104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18742167949676514},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11850908398628235}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8684080839157104},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8463979959487915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7215539216995239},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6156061291694641},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5646482706069946},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.520169734954834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3356972336769104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18742167949676514},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11850908398628235},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-98740-3_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-98740-3_27","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1007/s00236-026-00542-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-026-00542-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00542-1.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00236-026-00542-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-026-00542-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00542-1.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6924724968","display_name":null,"funder_award_id":"RTG\u20102126","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320318419","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413071367.pdf","grobid_xml":"https://content.openalex.org/works/W4413071367.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W91408871","https://openalex.org/W1636491287","https://openalex.org/W1680189815","https://openalex.org/W1835792195","https://openalex.org/W1973315504","https://openalex.org/W1980035156","https://openalex.org/W1985123706","https://openalex.org/W1993227852","https://openalex.org/W1998735557","https://openalex.org/W2011193572","https://openalex.org/W2053853578","https://openalex.org/W2120542281","https://openalex.org/W2126307323","https://openalex.org/W2143996311","https://openalex.org/W2402962589","https://openalex.org/W2418396476","https://openalex.org/W2469064012","https://openalex.org/W2770911772","https://openalex.org/W2778764888","https://openalex.org/W2898945074","https://openalex.org/W2963464777","https://openalex.org/W2963801132","https://openalex.org/W3081830327","https://openalex.org/W3083622237","https://openalex.org/W3100003759","https://openalex.org/W4206054140","https://openalex.org/W4220760292","https://openalex.org/W4234897719","https://openalex.org/W4380993509","https://openalex.org/W4403567983","https://openalex.org/W4413071367"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W4321600307","https://openalex.org/W4398796424","https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4364379828","https://openalex.org/W4386101755","https://openalex.org/W2037938733"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"consider":[2],"a":[3,8,14,18,27,64,116,133,169,201],"game-theoretic":[4],"variant":[5],"of":[6,30,56,66,78,142,157,185,194,203,206],"maximizing":[7],"monotone":[9],"increasing,":[10],"submodular":[11,94,187],"function":[12,95],"under":[13],"cardinality":[15,165,232],"constraint.":[16],"Initially,":[17],"solution":[19,179],"to":[20,74,88],"this":[21],"classic":[22],"problem":[23],"is":[24,73,96,197,230,248],"determined.":[25],"Subsequently,":[26],"predetermined":[28],"number":[29,156,193],"elements":[31,53],"from":[32,238],"the":[33,40,47,57,76,79,83,89,93,155,164,183,186,192,204,231],"ground":[34],"set,":[35],"not":[36],"necessarily":[37],"contained":[38],"in":[39,180],"initial":[41,58],"solution,":[42,59,81],"are":[43,61],"deleted,":[44,130],"potentially":[45],"reducing":[46],"solution\u2019s":[48],"cardinality.":[49,70],"If":[50],"any":[51],"deleted":[52],"were":[54],"part":[55],"they":[60],"replaced":[62],"with":[63,82,138],"set":[65],"at":[67,143,249],"most":[68],"equal":[69],"The":[71],"objective":[72],"maximize":[75],"value":[77],"ultimate":[80,90,178],"deletion":[84],"being":[85],"maximally":[86],"disadvantageous":[87],"solution.":[91,123],"When":[92,124,154],"$${{\\,\\mathrm{":[97],"\\text":[98],"{M}^\\natural":[99],"}\\,}}$$":[100],"<mml:math":[101,146,209],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[102,147,210],"<mml:mrow>":[103,213,219],"<mml:mspace/>":[104,109],"<mml:msup>":[105],"<mml:mtext>M</mml:mtext>":[106],"<mml:mo>\u266e</mml:mo>":[107],"</mml:msup>":[108],"</mml:mrow>":[110,223,224],"</mml:math>":[111,152,226],"-concave,":[112],"we":[113,131,167,234],"prove":[114],"that":[115,174,191,244],"simple":[117],"greedy":[118],"algorithm":[119,137,173,237],"computes":[120],"an":[121,139,176,236],"optimal":[122,177],"only":[125],"one":[126],"element":[127],"may":[128,159],"be":[129],"propose":[132],"polynomial":[134,170],"running":[135,171],"time":[136,172],"approximation":[140,246],"factor":[141,247],"least":[144,250],"$$\\frac{1}{3}$$":[145],"<mml:mfrac>":[148,211],"<mml:mn>1</mml:mn>":[149],"<mml:mn>3</mml:mn>":[150],"</mml:mfrac>":[151,225],".":[153],"deletions":[158,196],"become":[160],"as":[161,163],"large":[162],"parameter,":[166,233],"present":[168],"approximates":[175],"dependence":[181],"on":[182],"curvature":[184],"function.":[188],"Furthermore,":[189],"assuming":[190],"allowed":[195],"upper":[198],"bounded":[199],"by":[200],"term":[202],"order":[205],"$$\\frac{k}{\\log":[207],"_2^2(k)}$$":[208],"<mml:mi>k</mml:mi>":[212,221],"<mml:msubsup>":[214],"<mml:mo>log</mml:mo>":[215],"<mml:mn>2</mml:mn>":[216,217],"</mml:msubsup>":[218],"<mml:mo>(</mml:mo>":[220],"<mml:mo>)</mml:mo>":[222],",":[227],"where":[228],"k":[229],"adapt":[235],"Bogunovic":[239],"et":[240],"al.":[241],"and":[242],"show":[243],"its":[245],"0.108.":[251]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-08-11T00:00:00"}