{"id":"https://openalex.org/W2613774992","doi":"https://doi.org/10.1007/s10107-020-01576-0","title":"General bounds for incremental maximization","display_name":"General bounds for incremental maximization","publication_year":2020,"publication_date":"2020-10-20","ids":{"openalex":"https://openalex.org/W2613774992","doi":"https://doi.org/10.1007/s10107-020-01576-0","mag":"2613774992"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-020-01576-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01576-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01576-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01576-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033889707","display_name":"Aaron Bernstein","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aaron Bernstein","raw_affiliation_strings":["Rutgers University New Brunswick, New Brunswick, USA","SAS - Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University New Brunswick, New Brunswick, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"SAS - Computer Science","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021248592","display_name":"Yann Disser","orcid":"https://orcid.org/0000-0002-2085-0454"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yann Disser","raw_affiliation_strings":["TU Darmstadt, Darmstadt, Germany","Technische Universit\u00e4t Darmstadt,"],"raw_orcid":"https://orcid.org/0000-0002-2085-0454","affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt,","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048323285","display_name":"Martin Gro\u00df","orcid":"https://orcid.org/0000-0001-9220-5289"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Martin Gro\u00df","raw_affiliation_strings":["University of Waterloo, Waterloo, Canada","University of WAterloo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"University of WAterloo","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sandra Himburg","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sandra Himburg","raw_affiliation_strings":["TU Darmstadt, Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5033889707"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.1619,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49988821,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"191","issue":"2","first_page":"953","last_page":"979"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T11182","display_name":"Auction Theory and Applications","score":0.9901000261306763,"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/cardinality","display_name":"Cardinality (data modeling)","score":0.8441396951675415},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7827655076980591},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7730796933174133},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6638427972793579},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6234567761421204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6084524989128113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5886265635490417},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5512059330940247},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5428065061569214},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5394120812416077},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4613483250141144},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4575147032737732},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4499174952507019},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42608416080474854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28542059659957886}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.8441396951675415},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7827655076980591},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7730796933174133},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6638427972793579},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6234567761421204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6084524989128113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5886265635490417},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5512059330940247},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5428065061569214},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5394120812416077},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4613483250141144},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4575147032737732},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4499174952507019},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42608416080474854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28542059659957886},{"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},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":13,"locations":[{"id":"doi:10.1007/s10107-020-01576-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01576-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01576-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1705.10253","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.10253","pdf_url":"https://arxiv.org/pdf/1705.10253","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2613774992","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1705.10253.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:alma.01RUT_INST:11664798480004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/other/General-Bounds-for-Incremental-Maximization/991031664384704646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Other"},{"id":"pmh:oai:drops-oai.dagstuhl.de:7465","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.43","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:133247","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/133247/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:144561","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/144561/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:87113","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/87113/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Konferenzver\u00f6ffentlichung"},{"id":"pmh:oai:tuprints.ulb.tu-darmstadt.de:23878","is_oa":true,"landing_page_url":"https://tuprints.ulb.tu-darmstadt.de/23878/1/s10107-020-01576-0.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401590","display_name":"Technischen Universit\u00e4t Darmstadt","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"doi:10.48550/arxiv.1705.10253","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1705.10253","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.26083/tuprints-00023878","is_oa":true,"landing_page_url":"https://doi.org/10.26083/tuprints-00023878","pdf_url":null,"source":{"id":"https://openalex.org/S7407051655","display_name":"TUprints","issn_l":null,"issn":[],"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":"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":"article-journal"},{"id":"doi:10.4230/lipics.icalp.2017.43","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2017.43","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"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":""},{"id":"mag:2963315051","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2017/7465/pdf/LIPIcs-ICALP-2017-43.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418971","display_name":"International Colloquium on Automata, Languages and Programming","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":null,"raw_source_name":"International Colloquium on Automata, Languages and Programming","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/s10107-020-01576-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01576-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01576-0.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2088553165","display_name":null,"funder_award_id":"A07 of CRC TRR 154","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2862657677","display_name":null,"funder_award_id":"CRC TRR 154","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5754234484","display_name":null,"funder_award_id":"project A07","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7491996025","display_name":null,"funder_award_id":"TRR 154","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8864553253","display_name":null,"funder_award_id":"413095939","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323384","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2613774992.pdf","grobid_xml":"https://content.openalex.org/works/W2613774992.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W55614575","https://openalex.org/W1552828154","https://openalex.org/W1578891227","https://openalex.org/W1599161138","https://openalex.org/W1680189815","https://openalex.org/W1842846871","https://openalex.org/W1965270141","https://openalex.org/W1966793805","https://openalex.org/W1977429445","https://openalex.org/W1991528957","https://openalex.org/W1994753237","https://openalex.org/W2016428812","https://openalex.org/W2016973429","https://openalex.org/W2026891055","https://openalex.org/W2055696239","https://openalex.org/W2064594923","https://openalex.org/W2079266301","https://openalex.org/W2093376706","https://openalex.org/W2101864276","https://openalex.org/W2109209963","https://openalex.org/W2111741734","https://openalex.org/W2113195911","https://openalex.org/W2136442119","https://openalex.org/W2167112911","https://openalex.org/W2260605313","https://openalex.org/W2293386763","https://openalex.org/W2735725418","https://openalex.org/W2769245605","https://openalex.org/W2776000100","https://openalex.org/W2913331726","https://openalex.org/W4237780889","https://openalex.org/W4242737545","https://openalex.org/W7051650121"],"related_works":["https://openalex.org/W2963315051","https://openalex.org/W3173650354","https://openalex.org/W2735578456","https://openalex.org/W2900939397","https://openalex.org/W3209408294","https://openalex.org/W2946234094","https://openalex.org/W3048806178","https://openalex.org/W2263717697","https://openalex.org/W3047670293","https://openalex.org/W3130441624","https://openalex.org/W3035443347","https://openalex.org/W2962811043","https://openalex.org/W2789160222","https://openalex.org/W2978070678","https://openalex.org/W3155850186","https://openalex.org/W3017286006","https://openalex.org/W2883071313","https://openalex.org/W1526404960","https://openalex.org/W2883816296","https://openalex.org/W2774661250"],"abstract_inverted_index":{"Abstract":[0],"We":[1,61,94,116,194,225],"propose":[2],"a":[3,31,59,96,118,196,218,227,263,278],"theoretical":[4],"framework":[5,20],"to":[6,10,53,173,289,301],"capture":[7],"incremental":[8,70,81,121,154,190],"solutions":[9],"cardinality":[11,91,105,307],"constrained":[12,106,308],"maximization":[13,107],"problems.":[14,115],"The":[15],"defining":[16],"characteristic":[17],"of":[18,25,67,90,99,126,146,189,220,234,241,255,266,282],"our":[19,293,311],"is":[21,28,171,274],"that":[22,44,101,131,157,243,292],"the":[23,26,51,63,73,80,143,147,152,159,187,201,221,231,235,239,252,285,297,305,314],"cardinality/support":[24],"solution":[27,52,82,89],"bounded":[29],"by":[30],"value":[32,161],"$$k\\in":[33],"{\\mathbb":[34],"{N}}$$":[35],"<mml:math":[36],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[37],"<mml:mrow>":[38],"<mml:mi>k</mml:mi>":[39],"<mml:mo>\u2208</mml:mo>":[40],"<mml:mi>N</mml:mi>":[41],"</mml:mrow>":[42],"</mml:math>":[43],"grows":[45],"over":[46,76,318],"time,":[47],"and":[48,86,113,128,217,261,310],"we":[49,129,149],"allow":[50],"be":[54,174],"extended":[55],"one":[56],"element":[57],"at":[58],"time.":[60],"investigate":[62],"best-possible":[64],"competitive":[65,136,184,232,298],"ratio":[66,75,137,185,233],"such":[68],"an":[69,87],"solution,":[71],"i.e.,":[72],"worst":[74],"all":[77],"k":[78,84,92],"between":[79],"after":[83],"steps":[85],"optimum":[88],".":[93],"consider":[95],"large":[97],"class":[98,125,188,240,281],"problems":[100,108,191,205,242],"contains":[102],"many":[103],"important":[104],"like":[109,206],"maximum":[110,207,212,222,269],"matching,":[111,211],"knapsack,":[112],"packing/covering":[114],"provide":[117],"general":[119,228,280],"2.618-competitive":[120],"algorithm":[122,133,156,170,237,316],"for":[123,176,186,200,230,268,277,304,313],"this":[124,245],"problems,":[127,309],"show":[130,226],"no":[132],"can":[134],"have":[135],"below":[138],"2.18":[139],"in":[140,166],"general.":[141],"In":[142],"second":[144],"part":[145],"paper,":[148],"focus":[150],"on":[151,238,296],"inherently":[153],"greedy":[155,236,315],"increases":[158],"objective":[160,178,202],"as":[162,164,284],"much":[163],"possible":[165],"each":[167],"step.":[168],"This":[169],"known":[172],"1.58-competitive":[175],"submodular":[177],"functions,":[179],"but":[180],"it":[181],"has":[182],"unbounded":[183],"mentioned":[192],"above.":[193],"define":[195],"relaxed":[197,246],"submodularity":[198,247],"condition":[199],"function,":[203],"capturing":[204],"(weighted)":[208,213,270],"d":[209],"-dimensional":[210],"(":[214],"b":[215],"-)matching":[216],"variant":[219],"flow":[223],"problem.":[224],"bound":[229,250,254,265,273],"satisfy":[244],"condition.":[248],"Our":[249,272],"generalizes":[251],"(tight)":[253],"1.58":[256],"slightly":[257],"beyond":[258],"sub-modular":[259],"functions":[260,283],"yields":[262],"tight":[264,276],"2.313":[267],"(b-)matching.":[271],"also":[275],"more":[279],"relevant":[286],"parameter":[287],"goes":[288],"infinity.":[290],"Note":[291],"upper":[294],"bounds":[295,312],"ratios":[299,303],"translate":[300],"approximation":[302],"underlying":[306],"carry":[317],"both.":[319]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}