{"id":"https://openalex.org/W3004200571","doi":"https://doi.org/10.1007/978-3-030-39479-0_12","title":"Precedence-Constrained Scheduling and Min-Sum Set Cover","display_name":"Precedence-Constrained Scheduling and Min-Sum Set Cover","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3004200571","doi":"https://doi.org/10.1007/978-3-030-39479-0_12","mag":"3004200571"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-39479-0_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-39479-0_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5052572989","display_name":"Felix Happach","orcid":"https://orcid.org/0000-0002-8062-3632"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Felix Happach","raw_affiliation_strings":["Operations Research, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0002-8062-3632","affiliations":[{"raw_affiliation_string":"Operations Research, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103095757","display_name":"Andreas S. Schulz","orcid":"https://orcid.org/0000-0002-9595-459X"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas S. Schulz","raw_affiliation_strings":["Operations Research, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9595-459X","affiliations":[{"raw_affiliation_string":"Operations Research, Technische Universit\u00e4t M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052572989"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1461,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74953638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"170","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/set-cover-problem","display_name":"Set cover problem","score":0.7356959581375122},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7004771828651428},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6879453659057617},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6579066514968872},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6040112376213074},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5765349864959717},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5213926434516907},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4942612648010254},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47620758414268494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4590086340904236},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.4494924545288086},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44886481761932373},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.425252765417099},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4241301417350769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4125870168209076},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.41012585163116455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3872917592525482},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33846139907836914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23703652620315552},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.11555540561676025}],"concepts":[{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.7356959581375122},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7004771828651428},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6879453659057617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6579066514968872},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6040112376213074},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5765349864959717},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5213926434516907},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4942612648010254},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47620758414268494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4590086340904236},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.4494924545288086},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44886481761932373},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.425252765417099},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4241301417350769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4125870168209076},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.41012585163116455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3872917592525482},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33846139907836914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23703652620315552},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.11555540561676025},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-39479-0_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-39479-0_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:mediatum.ub.tum.de:node/1536853","is_oa":false,"landing_page_url":"https://mediatum.ub.tum.de/1536853","pdf_url":null,"source":{"id":"https://openalex.org/S4377196330","display_name":"mediaTUM  (Technical University of Munich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I62916508","host_organization_name":"Technical University of Munich","host_organization_lineage":["https://openalex.org/I62916508"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ConferencePaper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W179016828","https://openalex.org/W1481572477","https://openalex.org/W1488422606","https://openalex.org/W1508968115","https://openalex.org/W1554813885","https://openalex.org/W1960330418","https://openalex.org/W1967966457","https://openalex.org/W1978007997","https://openalex.org/W1988328380","https://openalex.org/W1992370758","https://openalex.org/W2026040656","https://openalex.org/W2040924621","https://openalex.org/W2044471216","https://openalex.org/W2058023231","https://openalex.org/W2060552317","https://openalex.org/W2075265959","https://openalex.org/W2081798943","https://openalex.org/W2085325317","https://openalex.org/W2088188524","https://openalex.org/W2093392878","https://openalex.org/W2096521993","https://openalex.org/W2120358419","https://openalex.org/W2127277545","https://openalex.org/W2130418601","https://openalex.org/W2134331592","https://openalex.org/W2145075017","https://openalex.org/W2147086810","https://openalex.org/W2148204686","https://openalex.org/W2150446509","https://openalex.org/W2152490496","https://openalex.org/W2160834479","https://openalex.org/W2163322487","https://openalex.org/W2165799042","https://openalex.org/W2166998862","https://openalex.org/W2175796269","https://openalex.org/W2557748541","https://openalex.org/W2777161377","https://openalex.org/W2957348754","https://openalex.org/W2963659614","https://openalex.org/W4244934433"],"related_works":["https://openalex.org/W2044818254","https://openalex.org/W2075346653","https://openalex.org/W2951839510","https://openalex.org/W2952019673","https://openalex.org/W2572017251","https://openalex.org/W2175796269","https://openalex.org/W2579422054","https://openalex.org/W3004200571","https://openalex.org/W3002345239","https://openalex.org/W1634583450"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}