{"id":"https://openalex.org/W4416379129","doi":"https://doi.org/10.1007/s00224-025-10248-5","title":"The Ground-Set-Cost Budgeted Maximum Coverage Problem","display_name":"The Ground-Set-Cost Budgeted Maximum Coverage Problem","publication_year":2025,"publication_date":"2025-11-20","ids":{"openalex":"https://openalex.org/W4416379129","doi":"https://doi.org/10.1007/s00224-025-10248-5","pmid":"https://pubmed.ncbi.nlm.nih.gov/41280270"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-025-10248-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10248-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10248-5.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10248-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109255833","display_name":"Irving van Heuven van Staereling","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Irving van Heuven van Staereling","raw_affiliation_strings":["Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands","Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091684842","display_name":"Bart de Keijzer","orcid":"https://orcid.org/0000-0001-9465-0837"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Bart de Keijzer","raw_affiliation_strings":["Department of Informatics, King's College London, 30 Aldwych, London, WC2B 4BG United Kingdom","Department of Informatics, King's College London, 30 Aldwych, London, WC2B 4BG, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-9465-0837","affiliations":[{"raw_affiliation_string":"Department of Informatics, King's College London, 30 Aldwych, London, WC2B 4BG United Kingdom","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Informatics, King's College London, 30 Aldwych, London, WC2B 4BG, United Kingdom","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067080233","display_name":"Guido Sch\u00e4fer","orcid":"https://orcid.org/0000-0002-1923-4902"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Guido Sch\u00e4fer","raw_affiliation_strings":["Institute for Logic, Language and Computation, University of Amsterdam, Science Park 107, 1098 XG Amsterdam, The Netherlands","Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands","Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1923-4902","affiliations":[{"raw_affiliation_string":"Institute for Logic, Language and Computation, University of Amsterdam, Science Park 107, 1098 XG Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]},{"raw_affiliation_string":"Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Networks & Optimization Group, Centrum Wiskunde & Informatica, Science Park 123, Amsterdam, 1098 XG, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5091684842"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38109263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"69","issue":"4","first_page":"39","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.8371999859809875,"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"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.8371999859809875,"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"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.09529999643564224,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.020500000566244125,"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/hypergraph","display_name":"Hypergraph","score":0.8191999793052673},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5638999938964844},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5331000089645386},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5131999850273132},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4722000062465668},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4462999999523163},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.44510000944137573},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.420199990272522},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41370001435279846}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8191999793052673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7053999900817871},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5638999938964844},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5331000089645386},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5131999850273132},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4948999881744385},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4722000062465668},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4433000087738037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.38999998569488525},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.3709999918937683},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.35530000925064087},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3495999872684479},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31700000166893005},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31369999051094055},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.2851000130176544},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2791000008583069},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.27160000801086426}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00224-025-10248-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10248-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10248-5.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmid:41280270","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/41280270","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of computing systems","raw_type":null},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/ee526351-72d3-4318-b9d1-22651058a046","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/the-groundsetcost-budgeted-maximum-coverage-problem(ee526351-72d3-4318-b9d1-22651058a046).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van Heuven van Staereling, I, de Keijzer, B & Sch\u00e4fer, G 2025, 'The Ground-Set-Cost Budgeted Maximum Coverage Problem', Theory of Computing Systems, vol. 69, no. 4, 39. https://doi.org/10.1007/s00224-025-10248-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:europepmc.org:11438040","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/12630262","pdf_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC12630262/pdf/224_2025_Article_10248.pdf","source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"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":null,"raw_type":"Text"},{"id":"pmh:oai:dare.uva.nl:openaire/ee526351-72d3-4318-b9d1-22651058a046","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/ee526351-72d3-4318-b9d1-22651058a046","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"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":"van Heuven van Staereling, I, de Keijzer, B & Sch\u00e4fer, G 2025, 'The Ground-Set-Cost Budgeted Maximum Coverage Problem', Theory of Computing Systems, vol. 69, no. 4, 39. https://doi.org/10.1007/s00224-025-10248-5","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s00224-025-10248-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-025-10248-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-025-10248-5.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2123642725","display_name":"Designing Efficient Market Mechanisms with Simplicity Requirements","funder_award_id":"EP/X021696/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416379129.pdf","grobid_xml":"https://content.openalex.org/works/W4416379129.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1956354821","https://openalex.org/W1967051853","https://openalex.org/W2030365814","https://openalex.org/W2042220084","https://openalex.org/W2065487600","https://openalex.org/W2080379754","https://openalex.org/W2084595628","https://openalex.org/W2107294939","https://openalex.org/W2119914577","https://openalex.org/W2132651631","https://openalex.org/W2143996311","https://openalex.org/W2552383377","https://openalex.org/W4212964627","https://openalex.org/W4236127247","https://openalex.org/W4300550233"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,13,193,204,228,243],"study":[2],"the":[3,8,52,56,66,81,118,123,128,155,182,213,217,223,258],"following":[4],"natural":[5,78],"variant":[6,153],"of":[7,45,55,69,80,127,154,216],"budgeted":[9,114],"maximum":[10,82,115,259],"coverage":[11,83,116],"problem:":[12],"are":[14,120,189],"given":[15],"a":[16,20,31,35,43,77,160,177,195,206,220,236,245],"budget":[17],"B":[18,64],"and":[19,34,65],"hypergraph":[21,218,224],"$$G":[22],"=":[23],"(V,":[24],"E)$$":[25],",":[26,254],"where":[27,255],"each":[28],"vertex":[29,260],"has":[30],"non-negative":[32,36],"cost":[33,54],"profit.":[37],"The":[38],"goal":[39],"is":[40,61,73,76,102,108,173,219,225,257],"to":[41,94,176,232],"select":[42],"set":[44],"hyperedges":[46,125],"$$T":[47],"\\subseteq":[48],"E$$":[49],"such":[50],"that":[51,105,170],"total":[53,67],"vertices":[57,72],"covered":[58,71,129],"by":[59],"T":[60],"at":[62,109],"most":[63],"profit":[68],"all":[70,251],"maximized.":[74],"This":[75,131],"generalization":[79],"problem.":[84,156],"Our":[85,186],"interest":[86],"in":[87,97],"this":[88,106,230],"problem":[89,107,172],"stems":[90],"from":[91,162],"its":[92],"application":[93],"bid":[95],"optimization":[96],"sponsored":[98],"search":[99],"auctions.":[100],"It":[101],"easily":[103],"seen":[104],"least":[110],"as":[111,113,190],"hard":[112],"(where":[117],"costs":[119],"associated":[121],"with":[122,235],"selected":[124],"instead":[126],"vertices).":[130],"implies":[132],"$$(1-1/e+\\epsilon":[133],")$$":[134],"-inapproximability":[135],"for":[136,151,201,250],"any":[137],"$$\\epsilon>":[138],"0$$":[139,253],".":[140],"Furthermore,":[141],"standard":[142],"greedy":[143],"approaches":[144],"do":[145],"not":[146],"yield":[147],"constant":[148,178],"factor":[149],"approximations":[150],"our":[152,171],"In":[157],"fact,":[158],"through":[159],"reduction":[161],"Densest":[163],"k":[164],"-Subgraph,":[165],"it":[166],"can":[167],"be":[168],"established":[169],"inapproximable":[174],"up":[175],"factor,":[179],"conditional":[180],"on":[181],"exponential":[183],"time":[184],"hypothesis.":[185],"main":[187],"results":[188],"follows:":[191],"(i.)":[192],"obtain":[194],"$$(1":[196],"-":[197],"1/\\sqrt{e})/2$$":[198],"-approximation":[199,248],"algorithm":[200,249],"graphs.":[202],"(ii.)":[203],"derive":[205],"fully":[207],"polynomial-time":[208],"approximation":[209],"scheme":[210],"(FPTAS)":[211],"if":[212],"incidence":[214,233],"graph":[215],"forest":[221],"(i.e.,":[222],"Berge-acyclic":[226],").":[227],"extend":[229],"result":[231],"graphs":[234],"fixed-size":[237],"feedback":[238],"hyperedge":[239],"node":[240],"set.":[241],"(iii.)":[242],"give":[244],"$$(1-\\varepsilon":[246],")/(2d^2)$$":[247],"$$\\varepsilon>":[252],"d":[256],"degree.":[261]},"counts_by_year":[],"updated_date":"2026-05-16T08:24:45.110214","created_date":"2025-11-20T00:00:00"}