{"id":"https://openalex.org/W2148450486","doi":"https://doi.org/10.1145/2987751","title":"Minimum Latency Submodular Cover","display_name":"Minimum Latency Submodular Cover","publication_year":2016,"publication_date":"2016-11-15","ids":{"openalex":"https://openalex.org/W2148450486","doi":"https://doi.org/10.1145/2987751","mag":"2148450486"},"language":"en","primary_location":{"id":"doi:10.1145/2987751","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2987751","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["University of California, Merced, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Merced, CA, USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["University of Michigan, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041229131","display_name":"Ruben van der Zwaan","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ruben Van Der Zwaan","raw_affiliation_strings":["Maastricht University, MD Maastricht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maastricht University, MD Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7209,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.733302,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"1","first_page":"1","last_page":"28"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9983000159263611,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.993399977684021,"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.8715667724609375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7885335683822632},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7271904349327087},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6605330109596252},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.614433765411377},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.5342845916748047},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5173139572143555},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5165983438491821},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5116736888885498},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.48861438035964966},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4364803731441498},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4351653456687927}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8715667724609375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7885335683822632},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7271904349327087},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6605330109596252},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.614433765411377},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.5342845916748047},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5173139572143555},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5165983438491821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5116736888885498},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.48861438035964966},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4364803731441498},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4351653456687927},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2987751","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2987751","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G691689332","display_name":null,"funder_award_id":"CCF-1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1484951415","https://openalex.org/W1583104845","https://openalex.org/W1605455774","https://openalex.org/W1714443387","https://openalex.org/W1854885336","https://openalex.org/W1970076003","https://openalex.org/W1975361422","https://openalex.org/W1978007997","https://openalex.org/W1983916623","https://openalex.org/W1984628625","https://openalex.org/W2014979132","https://openalex.org/W2025624833","https://openalex.org/W2029828838","https://openalex.org/W2030365814","https://openalex.org/W2062962786","https://openalex.org/W2115556222","https://openalex.org/W2123812793","https://openalex.org/W2134331592","https://openalex.org/W2147086810","https://openalex.org/W2151239055","https://openalex.org/W2165442026","https://openalex.org/W2166998862","https://openalex.org/W2170170950","https://openalex.org/W2225735400","https://openalex.org/W2295961103","https://openalex.org/W2590610501","https://openalex.org/W2610052675","https://openalex.org/W2963659614","https://openalex.org/W2988480584","https://openalex.org/W3030774092","https://openalex.org/W3098194985","https://openalex.org/W3135932689","https://openalex.org/W4210631930"],"related_works":["https://openalex.org/W2235694368","https://openalex.org/W2548642347","https://openalex.org/W4300592161","https://openalex.org/W2950198148","https://openalex.org/W4287322635","https://openalex.org/W3210745387","https://openalex.org/W3178236364","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097"],"abstract_inverted_index":{"We":[0,84,126,184],"study":[1,198],"the":[2,56,76,104,129,138,144,157,204],"Minimum":[3],"Latency":[4,130,158],"Submodular":[5,69,205],"Cover":[6,174,237],"(MLSC)":[7],"problem,":[8,135],"which":[9,136,219],"consists":[10],"of":[11,60,109,141,156,203],"a":[12,49,86,153,199],"metric":[13],"(":[14],"V":[15,23,40,191],",":[16,31,34],"d":[17],")":[18],"with":[19,213],"source":[20],"r":[21,53],"\u2208":[22],"and":[24,72,75,119,167,170,208,239,242],"m":[25,37,115],"monotone":[26],"submodular":[27],"functions":[28],"f":[29,32,36,112,145],"1":[30,118],"2":[33,39,189],"\u2026,":[35],":":[38],"\u2192":[41],"[0,":[42],"1].":[43],"The":[44],"goal":[45],"is":[46,103,123,137,152,220],"to":[47],"find":[48],"path":[50],"originating":[51],"at":[52],"that":[54],"minimizes":[55],"total":[57],"\u201ccover":[58],"time\u201d":[59],"all":[61],"functions.":[62,150],"This":[63,151,223],"generalizes":[64,226],"well-studied":[65],"problems,":[66,232],"such":[67,233],"as":[68,234],"Ranking":[70,206],"[Azar":[71,175],"Gamzu":[73],"2011]":[74,169],"Group":[77,159],"Steiner":[78,132,160],"Tree":[79,133,161],"[Garg":[80],"et":[81,163,176,180,247,251],"al.":[82,164,177,181,248,252],"2000].":[83],"give":[85],"polynomial":[87],"time":[88],"O":[89,187,215],"(log":[90,188,216],"1/\u03f5":[91],"\u010b":[92],"log":[93],"2+\u03b4":[94],"|V|)-approximation":[95],"algorithm":[96,193,212],"for":[97,194],"MLSC,":[98],"where":[99,143],"\u03f5":[100],">":[101,121],"0":[102,122],"smallest":[105],"non-zero":[106],"marginal":[107],"increase":[108],"any":[110,124],"{":[111],"i":[113,116,146],"}":[114],"=":[117],"\u03b4":[120],"constant.":[125],"also":[127,225],"consider":[128],"Covering":[131],"(LCST)":[134],"special":[139],"case":[140],"MLSC":[142],"s":[147],"are":[148],"multi-coverage":[149],"common":[154],"generalization":[155],"[Gupta":[162],"2010;":[165],"Chakrabarty":[166],"Swamy":[168],"Generalized":[171],"Min-sum":[172],"Set":[173,236],"2009;":[178],"Bansal":[179],"2010]":[182],"problems.":[183],"obtain":[185,209],"an":[186,210,214],"|":[190],"|)-approximation":[192],"LCST.":[195],"Finally,":[196],"we":[197],"natural":[200],"stochastic":[201,230],"extension":[202],"problem":[207],"adaptive":[211],"1/\u03f5)-approximation":[217],"ratio,":[218],"best":[221],"possible.":[222],"result":[224],"some":[227],"previously":[228],"studied":[229],"optimization":[231],"Stochastic":[235],"[Goemans":[238],"Vondr\u00e1k":[240],"2006]":[241],"Shared":[243],"Filter":[244],"Evaluation":[245],"[Munagala":[246],"2007;":[249],"Liu":[250],"2008].":[253]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}