{"id":"https://openalex.org/W7117489112","doi":"https://doi.org/10.1016/j.tcs.2025.115722","title":"Approximation algorithm for fair stochastic maximum coverage problem","display_name":"Approximation algorithm for fair stochastic maximum coverage problem","publication_year":2025,"publication_date":"2025-12-29","ids":{"openalex":"https://openalex.org/W7117489112","doi":"https://doi.org/10.1016/j.tcs.2025.115722"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2025.115722","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2025.115722","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":null,"display_name":"Mingchao Zhou","orcid":"https://orcid.org/0009-0007-3789-9872"},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingchao Zhou","raw_affiliation_strings":["School of Mathematical Sciences, Zhejiang Normal University, Jinhua Zhejiang, 321004, China"],"raw_orcid":"https://orcid.org/0009-0007-3789-9872","affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua Zhejiang, 321004, China","institution_ids":["https://openalex.org/I135237710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5121472417","display_name":"Zhao Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhao Zhang","raw_affiliation_strings":["School of Mathematical Sciences, Zhejiang Normal University, Jinhua Zhejiang, 321004, China"],"raw_orcid":"https://orcid.org/0000-0003-4191-7598","affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua Zhejiang, 321004, China","institution_ids":["https://openalex.org/I135237710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5121472417"],"corresponding_institution_ids":["https://openalex.org/I135237710"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71296367,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1065","issue":null,"first_page":"115722","last_page":"115722"},"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.43790000677108765,"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.43790000677108765,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.11999999731779099,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.11140000075101852,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7853999733924866},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7319999933242798},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5705000162124634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5562999844551086},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5214999914169312},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.5192000269889832},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4851999878883362}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7853999733924866},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7319999933242798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6987000107765198},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5705000162124634},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5562999844551086},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5214999914169312},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5192000269889832},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5047000050544739},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4851999878883362},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.428600013256073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40119999647140503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3993000090122223},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.33869999647140503},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.3384000062942505},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C2778408900","wikidata":"https://www.wikidata.org/wiki/Q1329258","display_name":"Cardinal number (linguistics)","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.2849000096321106},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2025.115722","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2025.115722","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2049111261","display_name":null,"funder_award_id":"12571342","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G5490956810","display_name":null,"funder_award_id":"U20A2068","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1990313671","https://openalex.org/W2011193572","https://openalex.org/W2072291569","https://openalex.org/W2112058494","https://openalex.org/W2143996311","https://openalex.org/W2148092222","https://openalex.org/W2560616732","https://openalex.org/W2917019893","https://openalex.org/W2963153710","https://openalex.org/W3029111965","https://openalex.org/W3122263697","https://openalex.org/W3140902323","https://openalex.org/W3181414820","https://openalex.org/W3213386156","https://openalex.org/W4212989190","https://openalex.org/W4282027681","https://openalex.org/W4311846487","https://openalex.org/W4386273732","https://openalex.org/W4394993263","https://openalex.org/W4399526654","https://openalex.org/W4403184265","https://openalex.org/W4410466486"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-01-19T04:01:09.351973","created_date":"2025-12-29T00:00:00"}