{"id":"https://openalex.org/W7166678601","doi":"https://doi.org/10.48550/arxiv.2606.28558","title":"Incremental Submodular Maximization: Better Than Greedy","display_name":"Incremental Submodular Maximization: Better Than Greedy","publication_year":2026,"publication_date":"2026-06-26","ids":{"openalex":"https://openalex.org/W7166678601","doi":"https://doi.org/10.48550/arxiv.2606.28558"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.28558","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28558","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.28558","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045471772","display_name":"Marcin Bie\u0144kowski","orcid":"https://orcid.org/0000-0002-2453-7772"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bienkowski, Marcin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139636499","display_name":"Joakim Blikstad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blikstad, Joakim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139637314","display_name":"Jaros\u0142aw Byrka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Byrka, Jaros\u0142aw","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109841317","display_name":"Mart\u00edn Costa","orcid":"https://orcid.org/0000-0002-0726-9083"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Costa, Mart\u00edn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021248592","display_name":"Yann Disser","orcid":"https://orcid.org/0000-0002-2085-0454"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Disser, Yann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014177295","display_name":"Annette Lutz","orcid":"https://orcid.org/0009-0008-7699-7018"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lutz, Annette","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":null,"last_page":null},"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.9749000072479248,"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.9749000072479248,"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.015300000086426735,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.8632000088691711},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6704999804496765},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6331999897956848},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6201000213623047},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.508400022983551},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5047000050544739},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5042999982833862},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.49799999594688416}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8632000088691711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6909000277519226},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6704999804496765},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6331999897956848},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6201000213623047},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5152000188827515},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.508400022983551},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5047000050544739},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5042999982833862},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.49799999594688416},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40209999680519104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.36410000920295715},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.32850000262260437},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.3046000003814697},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2815000116825104},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2741999924182892},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.26969999074935913},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.28558","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28558","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.28558","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28558","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"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":{"We":[0,70,82],"consider":[1],"submodular":[2,101],"maximization":[3],"under":[4],"increasing":[5],"cardinality":[6],"constraint":[7],"and":[8],"ask":[9],"for":[10,33,99],"a":[11,30,49,77,87],"good":[12,31],"incremental":[13,100],"solution,":[14],"i.e.,":[15,52],"an":[16,53,72],"ordering":[17,28],"of":[18,26,59,80,91],"the":[19,27,45,94],"ground":[20],"set":[21],"such":[22],"that":[23,44],"each":[24],"prefix":[25],"yields":[29],"solution":[32],"its":[34],"respective":[35],"cardinality.":[36],"A":[37],"classical":[38],"result":[39,85],"in":[40],"this":[41],"setting":[42],"is":[43],"greedy":[46],"algorithm":[47,75],"achieves":[48],"competitive":[50,78,97],"ratio,":[51],"approximation":[54],"guarantee":[55,66],"across":[56],"all":[57],"cardinalities,":[58],"$\\mathrm{e}/(\\mathrm{e}-1)":[60],"\\approx":[61],"1.582$.":[62],"No":[63],"better":[64],"general":[65],"was":[67],"previously":[68],"known.":[69],"present":[71],"adaptive":[73],"scaling":[74],"achieving":[76],"ratio":[79,98],"$1.373$.":[81],"complement":[83],"our":[84],"by":[86],"deterministic":[88],"lower":[89],"bound":[90],"$1.25$":[92],"on":[93],"best":[95],"possible":[96],"maximization.":[102]},"counts_by_year":[],"updated_date":"2026-07-01T06:29:00.853634","created_date":"2026-07-01T00:00:00"}