{"id":"https://openalex.org/W4385562547","doi":"https://doi.org/10.1145/3580305.3599259","title":"Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time","display_name":"Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time","publication_year":2023,"publication_date":"2023-08-04","ids":{"openalex":"https://openalex.org/W4385562547","doi":"https://doi.org/10.1145/3580305.3599259"},"language":"en","primary_location":{"id":"doi:10.1145/3580305.3599259","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3580305.3599259","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580305.3599259","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3580305.3599259","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072374914","display_name":"Y.-M. Chen","orcid":"https://orcid.org/0000-0001-8611-2828"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yixin Chen","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083575259","display_name":"Alan Kuhnle","orcid":"https://orcid.org/0000-0001-6506-1902"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Kuhnle","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072374914"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.0085,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79444011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"261"},"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.9998000264167786,"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.9998000264167786,"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.9940000176429749,"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/T10237","display_name":"Cryptography and Data Security","score":0.9929999709129333,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8449572920799255},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7033929228782654},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6612282991409302},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6435837745666504},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.6354131102561951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5543924570083618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5239053964614868},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.515228807926178},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5046736001968384},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.49305054545402527},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4797198176383972},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42609232664108276},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4033965468406677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38624107837677},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.15813866257667542},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06997275352478027}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8449572920799255},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7033929228782654},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6612282991409302},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6435837745666504},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.6354131102561951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5543924570083618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5239053964614868},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.515228807926178},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5046736001968384},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.49305054545402527},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4797198176383972},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42609232664108276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4033965468406677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38624107837677},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.15813866257667542},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06997275352478027},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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":1,"locations":[{"id":"doi:10.1145/3580305.3599259","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3580305.3599259","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580305.3599259","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3580305.3599259","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3580305.3599259","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580305.3599259","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385562547.pdf","grobid_xml":"https://content.openalex.org/works/W4385562547.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W331442585","https://openalex.org/W398859631","https://openalex.org/W1680189815","https://openalex.org/W1989151913","https://openalex.org/W1997783781","https://openalex.org/W1997959284","https://openalex.org/W2031327377","https://openalex.org/W2110373679","https://openalex.org/W2158557760","https://openalex.org/W2790597304","https://openalex.org/W2883693373","https://openalex.org/W2952201503","https://openalex.org/W2952359104","https://openalex.org/W2962827663","https://openalex.org/W3038050179","https://openalex.org/W3160905013","https://openalex.org/W4231490457"],"related_works":["https://openalex.org/W2963844234","https://openalex.org/W2803250016","https://openalex.org/W2788127768","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W2963443186","https://openalex.org/W3204684126","https://openalex.org/W4382197677","https://openalex.org/W2062310236","https://openalex.org/W3013568067"],"abstract_inverted_index":{"In":[0],"this":[1,51],"work,":[2],"we":[3,102],"study":[4],"the":[5,9,22,44,57,80,121],"problem":[6,29,52],"of":[7,12,24,74,93,110,126],"finding":[8],"maximum":[10],"value":[11],"a":[13,19,27,67,72,85,91,96,104],"non-negative":[14],"submodular":[15],"function":[16],"subject":[17],"to":[18,120],"limit":[20],"on":[21],"number":[23],"items":[25],"selected,":[26],"ubiquitous":[28],"that":[30,53,107],"appears":[31],"in":[32,114,130],"many":[33],"applications,":[34],"such":[35],"as":[36],"data":[37],"summarization":[38],"and":[39,95],"nonlinear":[40],"regression.":[41],"We":[42,61],"provide":[43],"first":[45,81],"deterministic,":[46,64],"linear-time":[47,65,82,88],"approximation":[48],"algorithms":[49],"for":[50],"do":[54],"not":[55],"assume":[56],"objective":[58],"is":[59,79],"monotone.":[60],"present":[62,103],"three":[63],"algorithms:":[66],"single-pass":[68],"streaming":[69,83],"algorithm":[70,89,106],"with":[71,90],"ratio":[73,92,109,125],"23.313":[75],"+":[76,98,112],"\u03b5,":[77],"which":[78],"algorithm;":[84],"simpler":[86],"deterministic":[87,105],"11.657;":[94],"(4":[97],"O(\u03b5))-approximation":[99],"algorithm.":[100],"Finally,":[101],"obtains":[108],"e":[111,127],"\u03b5":[113],"O_\u03b5":[115],"(n":[116],"log(n))":[117],"time,":[118],"close":[119],"best":[122],"known":[123],"expected":[124],"-":[128],"0.121":[129],"polynomial":[131],"time.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}