{"id":"https://openalex.org/W2789166622","doi":"https://doi.org/10.1142/s0129054117500344","title":"Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover","display_name":"Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2789166622","doi":"https://doi.org/10.1142/s0129054117500344","mag":"2789166622"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054117500344","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500344","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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":"https://openalex.org/A5100808224","display_name":"Wenyi Hong","orcid":null},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenyi Hong","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100628477","display_name":"Zhenbo Wang","orcid":"https://orcid.org/0000-0003-1359-4621"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhenbo Wang","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100628477"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.219,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62621811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"28","issue":"08","first_page":"977","last_page":"992"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/vertex-cover","display_name":"Vertex cover","score":0.8099758625030518},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6367979049682617},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4966962933540344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48322686553001404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.478685200214386},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4760577380657196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4274849593639374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39353683590888977},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20427629351615906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14988973736763}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8099758625030518},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6367979049682617},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4966962933540344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48322686553001404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.478685200214386},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4760577380657196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4274849593639374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39353683590888977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20427629351615906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14988973736763}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054117500344","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054117500344","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322392","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1970592111","https://openalex.org/W1990313671","https://openalex.org/W2011039300","https://openalex.org/W2037958162","https://openalex.org/W2067297441","https://openalex.org/W2093979815","https://openalex.org/W2104680817","https://openalex.org/W2112504072","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W2161836078","https://openalex.org/W4234582748"],"related_works":["https://openalex.org/W3014082529","https://openalex.org/W2950838401","https://openalex.org/W1608414128","https://openalex.org/W2796050003","https://openalex.org/W41549461","https://openalex.org/W2579422054","https://openalex.org/W181072447","https://openalex.org/W2555021383","https://openalex.org/W2281046621","https://openalex.org/W2040480264"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,11,33,40],"combination":[4],"problem":[5,26],"of":[6,35],"parallel":[7,36],"machine":[8],"scheduling":[9],"and":[10,16,67],"vertex":[12],"cover":[13],"problem.":[14],"Wang":[15],"Cui":[17],"developed":[18],"a":[19],"[Formula:":[20,29,44,48,52,56,60,64,69,73],"see":[21,30,45,49,53,57,61,65,70,74],"text]-approximation":[22],"algorithm":[23],"for":[24,51,63,72],"this":[25],"[13],":[27],"where":[28],"text]":[31,46,50,58,62,71],"is":[32],"number":[34],"machines.":[37],"We":[38],"reduce":[39],"approximation":[41],"factors":[42],"from":[43,55],"to":[47,59,68],"text],":[54,66],"text].":[75]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}