{"id":"https://openalex.org/W2093392878","doi":"https://doi.org/10.1007/s00453-008-9251-6","title":"Single Machine Precedence Constrained Scheduling Is a\u00a0Vertex Cover Problem","display_name":"Single Machine Precedence Constrained Scheduling Is a\u00a0Vertex Cover Problem","publication_year":2008,"publication_date":"2008-11-21","ids":{"openalex":"https://openalex.org/W2093392878","doi":"https://doi.org/10.1007/s00453-008-9251-6","mag":"2093392878"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9251-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9251-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5085876663","display_name":"Christoph Amb\u00fchl","orcid":null},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Christoph Amb\u00fchl","raw_affiliation_strings":["University of Liverpool, Liverpool, UK","University of LIverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"University of LIverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053978143","display_name":"Monaldo Mastrolilli","orcid":"https://orcid.org/0000-0002-2948-9749"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Monaldo Mastrolilli","raw_affiliation_strings":["IDSIA, Manno, Lugano, Switzerland","IDSIA, Manno-Lugano, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, Manno, Lugano, Switzerland","institution_ids":["https://openalex.org/I2614128279"]},{"raw_affiliation_string":"IDSIA, Manno-Lugano, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085876663"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":9.1846,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.97439042,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"53","issue":"4","first_page":"488","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9934999942779541,"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.8314496278762817},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6415859460830688},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6030575633049011},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5957015752792358},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5918570756912231},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.5731843113899231},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48268985748291016},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4748692214488983},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45593374967575073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3761586546897888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3513132333755493},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35124170780181885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2764396071434021},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21183079481124878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20605918765068054},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.07264429330825806}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8314496278762817},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6415859460830688},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6030575633049011},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5957015752792358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5918570756912231},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5731843113899231},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48268985748291016},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4748692214488983},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45593374967575073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3761586546897888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3513132333755493},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35124170780181885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2764396071434021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21183079481124878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20605918765068054},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.07264429330825806},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-008-9251-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9251-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320319997","display_name":"Nuffield Foundation","ror":"https://ror.org/0281jqk77"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W179016828","https://openalex.org/W1486993561","https://openalex.org/W1488422606","https://openalex.org/W1496117300","https://openalex.org/W1500392054","https://openalex.org/W1569458199","https://openalex.org/W1585310225","https://openalex.org/W1603384057","https://openalex.org/W1960330418","https://openalex.org/W1988328380","https://openalex.org/W1992370758","https://openalex.org/W1997570332","https://openalex.org/W1999032440","https://openalex.org/W2006905044","https://openalex.org/W2013415302","https://openalex.org/W2034689708","https://openalex.org/W2050272710","https://openalex.org/W2075339720","https://openalex.org/W2077783414","https://openalex.org/W2083199589","https://openalex.org/W2096521993","https://openalex.org/W2127277545","https://openalex.org/W2130418601","https://openalex.org/W2140566134","https://openalex.org/W2143698439","https://openalex.org/W2145075017","https://openalex.org/W2148204686","https://openalex.org/W2150446509","https://openalex.org/W2154635726","https://openalex.org/W2156760067","https://openalex.org/W2157316274","https://openalex.org/W2163626560","https://openalex.org/W2165799042","https://openalex.org/W2576116471","https://openalex.org/W2808376720","https://openalex.org/W4256581173","https://openalex.org/W4285719527","https://openalex.org/W4319782100"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W4244658307","https://openalex.org/W2112112676","https://openalex.org/W2063671489","https://openalex.org/W4247100793","https://openalex.org/W2156896570","https://openalex.org/W1566660502","https://openalex.org/W3111015064","https://openalex.org/W1966805076","https://openalex.org/W1558145674"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}