{"id":"https://openalex.org/W4247100793","doi":"https://doi.org/10.1002/net.20265","title":"The multi\u2010integer set cover and the facility terminal cover problem","display_name":"The multi\u2010integer set cover and the facility terminal cover problem","publication_year":2008,"publication_date":"2008-08-13","ids":{"openalex":"https://openalex.org/W4247100793","doi":"https://doi.org/10.1002/net.20265"},"language":"en","primary_location":{"id":"doi:10.1002/net.20265","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.20265","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.20265","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.20265","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, California 94720"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research and Walter A. Haas School of Business, University of California, Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064961974","display_name":"Asaf Levin","orcid":"https://orcid.org/0000-0001-7935-6218"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Asaf Levin","raw_affiliation_strings":["Department of Statistics, The Hebrew University, Jerusalem 91905, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Statistics, The Hebrew University, Jerusalem 91905, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064961974"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.4005,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72129883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"1","first_page":"63","last_page":"66"},"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.9939000010490417,"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.9939000010490417,"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.9926999807357788,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.9072978496551514},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.8245538473129272},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.8082512617111206},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7679063081741333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6529557704925537},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6124995946884155},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.60908442735672},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.579273521900177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5764003992080688},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5364426374435425},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5187990069389343},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4716937839984894},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4520731270313263},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.423044353723526},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41225767135620117},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41123878955841064},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3529728651046753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24357041716575623}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.9072978496551514},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.8245538473129272},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.8082512617111206},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7679063081741333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6529557704925537},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6124995946884155},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.60908442735672},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.579273521900177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5764003992080688},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5364426374435425},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5187990069389343},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4716937839984894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4520731270313263},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.423044353723526},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41225767135620117},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41123878955841064},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3529728651046753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24357041716575623},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.20265","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.20265","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.20265","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/net.20265","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.20265","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.20265","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4247100793.pdf"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1519655831","https://openalex.org/W1524356573","https://openalex.org/W2029933769","https://openalex.org/W2064600658","https://openalex.org/W2069870307","https://openalex.org/W2077783414","https://openalex.org/W2088188524","https://openalex.org/W2112112676","https://openalex.org/W2143698439","https://openalex.org/W2595400776"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W1966805076","https://openalex.org/W2063671489","https://openalex.org/W1502438505","https://openalex.org/W2077783414","https://openalex.org/W1498886170","https://openalex.org/W168093571","https://openalex.org/W4385317342"],"abstract_inverted_index":{"Abstract":[0],"The":[1,14,83],"facility":[2,150,217],"terminal":[3,151,218],"cover":[4,12,152,166,184,199,204,219],"problem":[5,15,137,153,162,200,220],"is":[6,16,36,52,62,74,85,111],"a":[7,39,77,129,177,223],"generalization":[8],"of":[9,21,58,65,142,215,234,246],"the":[10,19,104,140,143,149,155,164,172,181,188,196,202,206,212,216,232,235,244],"vertex":[11,72,95],"problem.":[13,174],"to":[17,86,93,154,163],"\u201ccover\u201d":[18],"edges":[20,100],"an":[22],"undirected":[23],"graph":[24],"G":[25],"=":[26,48],"(":[27],"V":[28],",":[29,50,110],"E":[30],")":[31],"where":[32],"each":[33,94],"edge":[34,46,236],"e":[35,43,47,69,131,139],"associated":[37,75],"with":[38,76,227],"non\u2010negative":[40,78],"demand":[41],"d":[42,68],".":[44,70,82],"An":[45],"u":[49],"v":[51,73,81,90,96],"covered":[53,102],"if":[54],"at":[55,66],"least":[56,67],"one":[57],"its":[59],"endpoint":[60],"vertices":[61],"allocated":[63],"capacity":[64,88],"Each":[71],"weight":[79],"w":[80],"goal":[84],"allocate":[87],"c":[89],"\u2265":[91],"0":[92],"so":[97],"that":[98,161,193],"all":[99],"are":[101],"and":[103,127,159,171,226],"total":[105],"allocation":[106],"cost,":[107],"$\\sum\\limits_{v\\in":[108],"V}w_{v}c_{v}$":[109],"minimized.":[112],"A":[113],"recent":[114],"paper":[115],"by":[116,231],"Xu":[117,247],"et":[118,248],"al.":[119,249],"[Networks":[120],"50":[121],"(2007),":[122],"118\u2010126],":[123],"studied":[124],"this":[125,136,221],"problem,":[126,167,185,205],"presented":[128],"2":[130],"\u2010":[132],"approximation":[133,208,239],"algorithm":[134,179,240],"for":[135,138,180,186],"base":[141],"natural":[144],"logarithm.":[145],"We":[146,175],"generalize":[147],"here":[148],"multi\u2010integer":[156,182,197],"set":[157,165,183,198,203],"cover,":[158],"relate":[160],"which":[168],"it":[169],"generalizes,":[170],"multi\u2010cover":[173],"present":[176],"\u0394\u2010approximation":[178],"\u0394":[187],"maximum":[189],"coverage.":[190],"This":[191,238],"demonstrates":[192],"even":[194],"though":[195],"generalizes":[201],"same":[207],"ratio":[209],"holds.":[210],"In":[211],"special":[213],"case":[214],"yields":[222],"2\u2010approximation":[224],"algorithm,":[225],"run":[228],"time":[229],"dominated":[230],"sorting":[233],"demands.":[237],"improves":[241],"considerably":[242],"on":[243],"result":[245],"\u00a9":[250],"2008":[251],"Wiley":[252],"Periodicals,":[253],"Inc.":[254],"NETWORKS,":[255],"2009":[256]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}