乐胖代购免代理版

{"id":"https://openalex.org/W3032876419","doi":"https://doi.org/10.1007/s00224-020-09981-w","title":"Parameterized Complexity of Min-Power Asymmetric Connectivity","display_name":"Parameterized Complexity of Min-Power Asymmetric Connectivity","publication_year":2020,"publication_date":"2020-05-23","ids":{"openalex":"https://openalex.org/W3032876419","doi":"https://doi.org/10.1007/s00224-020-09981-w","mag":"3032876419"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-020-09981-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-020-09981-w.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-020-09981-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086072107","display_name":"Matthias Bentert","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Bentert","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014406119","display_name":"Roman Haag","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roman Haag","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034761074","display_name":"Christian Hofer","orcid":"https://orcid.org/0000-0003-1721-4606"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Hofer","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088434500","display_name":"Tomohiro Koana","orcid":"https://orcid.org/0000-0002-8684-0611"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tomohiro Koana","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890,"provenance":"doaj"},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890,"provenance":"doaj"},"fwci":0.571,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69135,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":79,"max":81},"biblio":{"volume":"64","issue":"7","first_page":"1158","last_page":"1182"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.999,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.999,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9968,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9929,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5737386},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.54327315},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.42421982}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8233179},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.64530134},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5737386},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.54327315},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.53765994},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.53556126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49634653},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4697856},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4622917},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.42421982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3931436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37477106},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-020-09981-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-020-09981-w.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-020-09981-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-020-09981-w.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":19,"referenced_works":["https://openalex.org/W1522456302","https://openalex.org/W1541256735","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2004706672","https://openalex.org/W2012760542","https://openalex.org/W2034799053","https://openalex.org/W2088273596","https://openalex.org/W2112341077","https://openalex.org/W2116087731","https://openalex.org/W2117768029","https://openalex.org/W2122877877","https://openalex.org/W2125578939","https://openalex.org/W2146185076","https://openalex.org/W2158465338","https://openalex.org/W2163123280","https://openalex.org/W2624846542","https://openalex.org/W2978192884","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4294702976","https://openalex.org/W4226494131","https://openalex.org/W3105736412","https://openalex.org/W3092119098","https://openalex.org/W3003480140","https://openalex.org/W2963135821","https://openalex.org/W2915580243","https://openalex.org/W2776184136","https://openalex.org/W2066526134","https://openalex.org/W2049969628"],"abstract_inverted_index":{"Abstract":[0],"We":[1,56],"investigate":[2],"parameterized":[3],"algorithms":[4,59],"for":[5,27,60],"the":[6,34,39,45,53,61,64,76,81,93,100],"NP-hard":[7],"problem":[8,94],"Min-Power":[9],"Asymmetric":[10],"Connectivity":[11],"(MinPAC)":[12],"that":[13,92],"has":[14],"applications":[15],"in":[16,52,70,80],"wireless":[17],"sensor":[18],"networks.":[19],"Given":[20],"a":[21,28,71],"directed":[22],"arc-weighted":[23],"graph,":[24],"MinPAC":[25],"asks":[26],"strongly":[29,67],"connected":[30,68],"spanning":[31],"subgraph":[32,74],"minimizing":[33],"summed":[35],"vertex":[36,43],"costs.":[37],"Here,":[38],"cost":[40],"of":[41,47,66],"each":[42],"is":[44,85,95],"weight":[46],"its":[48],"heaviest":[49],"outgoing":[50],"arc":[51,110,113],"chosen":[54],"subgraph.":[55],"present":[57],"linear-time":[58],"cases":[62],"where":[63],"number":[65,79],"components":[69],"so-called":[72],"obligatory":[73],"or":[75],"feedback":[77,109],"edge":[78],"underlying":[82],"undirected":[83],"graph":[84],"constant.":[86],"Complementing":[87],"these":[88],"results,":[89],"we":[90],"prove":[91],"W[2]-hard":[96],"with":[97,107],"respect":[98],"to":[99],"solution":[101],"cost,":[102],"even":[103],"on":[104],"restricted":[105],"graphs":[106],"one":[108],"and":[111],"binary":[112],"weights.":[114]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3032876419","counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2024-12-13T07:47:07.575754","created_date":"2020-06-05"}