{"id":"https://openalex.org/W3088600614","doi":"https://doi.org/10.1007/978-3-030-48439-2_41","title":"Subset Sum Problems with Special Digraph Constraints","display_name":"Subset Sum Problems with Special Digraph Constraints","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3088600614","doi":"https://doi.org/10.1007/978-3-030-48439-2_41","mag":"3088600614"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-48439-2_41","doi":"https://doi.org/10.1007/978-3-030-48439-2_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-48439-2_41","pdf_url":null,"source":{"id":"https://openalex.org/S4210184104","display_name":"Operations research proceedings","issn_l":"0721-5924","issn":["0721-5924","2197-9294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Proceedings","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W2480634980","display_name":"Operations Research Proceedings 2019"},"type":"book-chapter","is_traditional":true,"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/A5031299024","display_name":"Frank Gurski","orcid":"https://orcid.org/0000-0002-1212-1796","observed_orcids":["https://orcid.org/0000-0002-1212-1796"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Gurski","raw_affiliation_strings":["University of D\u00fcsseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of D\u00fcsseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001983447","display_name":"Dominique Komander","orcid":"https://orcid.org/0000-0001-6990-5164","observed_orcids":["https://orcid.org/0000-0001-6990-5164"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominique Komander","raw_affiliation_strings":["University of D\u00fcsseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of D\u00fcsseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061111704","display_name":"Carolin Rehs","orcid":"https://orcid.org/0000-0002-8788-1028","observed_orcids":["https://orcid.org/0000-0002-8788-1028"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carolin Rehs","raw_affiliation_strings":["University of D\u00fcsseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of D\u00fcsseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031299024"],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":null,"apc_paid":null,"fwci":3.9056,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.93548387,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"339","last_page":"346"},"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.7157999873161316,"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.7157999873161316,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.28220000863075256,"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/T12176","display_name":"Optimization and Packing Problems","score":0.0008999999845400453,"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/subset-sum-problem","display_name":"subset sum problem","score":0.984000027179718},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8259999752044678},{"id":"https://openalex.org/keywords/pseudo-polynomial-time-algorithm","display_name":"pseudo-polynomial time algorithm","score":0.843999981880188},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.8510000109672546},{"id":"https://openalex.org/keywords/oriented-trees","display_name":"oriented trees","score":0.9559999704360962},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6690000295639038}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.9522736072540283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.793567419052124},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6670743823051453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6588649749755859},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4905063509941101},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48187026381492615},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4111630618572235},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4109940528869629},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28810277581214905},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-48439-2_41","doi":"https://doi.org/10.1007/978-3-030-48439-2_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-48439-2_41","pdf_url":null,"source":{"id":"https://openalex.org/S4210184104","display_name":"Operations research proceedings","issn_l":"0721-5924","issn":["0721-5924","2197-9294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Proceedings","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1985495277","https://openalex.org/W2094090625","https://openalex.org/W2095917812","https://openalex.org/W2110920860","https://openalex.org/W2157952725","https://openalex.org/W2512912683","https://openalex.org/W4248481689"],"related_works":["https://openalex.org/W3015375771","https://openalex.org/W2512912683","https://openalex.org/W4308499161","https://openalex.org/W7096306849","https://openalex.org/W4200106371","https://openalex.org/W4250937028","https://openalex.org/W4293423503","https://openalex.org/W1969940463","https://openalex.org/W2085634670","https://openalex.org/W7171823803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2020-10-01T00:00:00"}
