{"id":"https://openalex.org/W2763619719","doi":"https://doi.org/10.1137/18m1209489","title":"Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices","display_name":"Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2763619719","doi":"https://doi.org/10.1137/18m1209489","mag":"2763619719"},"language":"en","primary_location":{"id":"doi:10.1137/18m1209489","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1209489","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1710.00668","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Pavel Dvo\u0159\u00e1k","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavel Dvo\u0159\u00e1k","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Andreas E. Feldmann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas E. Feldmann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2588-5709","affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","orcid":"https://orcid.org/0000-0001-8524-4036"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8524-4036","affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Tom\u00e1\u0161 Toufar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Toufar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Pavel Vesel\u00fd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavel Vesel\u00fd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9243,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76646656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"35","issue":"1","first_page":"546","last_page":"574"},"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.6425999999046326,"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.6425999999046326,"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.18860000371932983,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.04899999871850014,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9700999855995178},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.808899998664856},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.6279000043869019},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5232999920845032},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4187999963760376},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4025999903678894},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.37940001487731934},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.35510000586509705},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.33629998564720154}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9700999855995178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8216000199317932},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.808899998664856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7949000000953674},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.6279000043869019},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5281000137329102},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5232999920845032},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4187999963760376},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4025999903678894},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.37940001487731934},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3328000009059906},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.328900009393692},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.3255999982357025},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C175695255","wikidata":"https://www.wikidata.org/wiki/Q4420916","display_name":"Steiner system","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2727000117301941},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.2653999924659729},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/18m1209489","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1209489","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:144582","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:arXiv.org:1710.00668","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.00668","pdf_url":"https://arxiv.org/pdf/1710.00668","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1710.00668","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.00668","pdf_url":"https://arxiv.org/pdf/1710.00668","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1578789027","https://openalex.org/W1976584101","https://openalex.org/W1996668544","https://openalex.org/W2003753063","https://openalex.org/W2009976792","https://openalex.org/W2011823863","https://openalex.org/W2035613592","https://openalex.org/W2045749371","https://openalex.org/W2052712469","https://openalex.org/W2056824842","https://openalex.org/W2076461672","https://openalex.org/W2559423605"],"related_works":[],"abstract_inverted_index":{"We":[0,105,194],"study":[1,107],"the":[2,18,33,55,60,67,91,102,108,136,147,153,172,212,217],"Steiner":[3,45,115,120,123,140,158,162,187,206,215],"Tree":[4,46,121,163],"problem,":[5],"in":[6,17,22,66,209],"which":[7,82],"a":[8,94,190,203,230],"set":[9],"of":[10,35,62,93,111,114,127,171,214,219,222],"terminal":[11],"vertices":[12],"needs":[13],"to":[14,49,72,133,211,228],"be":[15,50,229],"connected":[16,220],"cheapest":[19],"possible":[20],"way":[21],"an":[23,76,130,142,181,200,223],"edge-weighted":[24],"graph.":[25],"This":[26],"problem":[27,148],"has":[28],"been":[29],"extensively":[30],"studied":[31,137,173],"from":[32],"viewpoint":[34],"approximation":[36,79],"and":[37,52,122,202],"also":[38,195],"parameterization.":[39],"In":[40,70],"particular,":[41],"on":[42,54],"one":[43],"hand":[44],"is":[47,129,149,175,199,226],"known":[48],"${APX}$-hard,":[51,150],"${W[2]}$-hard":[53],"other,":[56],"if":[57,152,208],"parameterized":[58,78,109],"by":[59],"number":[61,213,218],"nonterminals":[63],"(Steiner":[64],"vertices)":[65],"optimum":[68],"solution.":[69],"contrast":[71],"this,":[73],"we":[74,164,178],"give":[75],"efficient":[77],"scheme":[80,99],"(${EPAS}$),":[81],"circumvents":[83],"both":[84],"hardness":[85],"results.":[86],"Moreover,":[87],"our":[88],"methods":[89],"imply":[90],"existence":[92],"polynomial":[95],"size":[96],"approximate":[97],"kernelization":[98],"(${PSAKS}$)":[100],"for":[101,135,184,205],"considered":[103,227],"parameter.":[104,138,231],"further":[106],"approximability":[110],"other":[112],"variants":[113],"Tree,":[116,188],"such":[117],"as":[118],"Directed":[119,161,186],"Forest.":[124],"For":[125,139,160],"none":[126],"these":[128],"${EPAS}$":[131,182,201],"likely":[132],"exist":[134],"Forest":[141,207],"easy":[143],"observation":[144],"shows":[145],"that":[146,166,180,197],"even":[151],"input":[154],"graph":[155],"contains":[156],"no":[157],"vertices.":[159],"prove":[165,196],"approximating":[167],"within":[168],"any":[169],"function":[170],"parameter":[174],"${W[1]}$-hard.":[176],"Nevertheless,":[177],"show":[179],"exists":[183],"Unweighted":[185],"but":[189],"${PSAKS}$":[191,204],"does":[192],"not.":[193],"there":[198],"addition":[210],"vertices,":[216],"components":[221],"optimal":[224],"solution":[225]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2017-10-20T00:00:00"}