{"id":"https://openalex.org/W2944399784","doi":"https://doi.org/10.1007/s00453-019-00580-x","title":"A Tight Lower Bound for Planar Steiner Orientation","display_name":"A Tight Lower Bound for Planar Steiner Orientation","publication_year":2019,"publication_date":"2019-05-04","ids":{"openalex":"https://openalex.org/W2944399784","doi":"https://doi.org/10.1007/s00453-019-00580-x","mag":"2944399784"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00580-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00580-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00580-x.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00580-x.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000019988","display_name":"Andreas Emil Feldmann","orcid":"https://orcid.org/0000-0001-6229-5332"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Andreas Emil Feldmann","raw_affiliation_strings":["Charles University in Prague, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Charles University in Prague, Prague, Czechia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062803495","display_name":"Ond\u0159ej Such\u00fd","orcid":"https://orcid.org/0000-0002-7236-8336"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ond\u0159ej Such\u00fd","raw_affiliation_strings":["Faculty of Information Technology, Czech Technical University in Prague, Prague, Czechia"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Czech Technical University in Prague, Prague, Czechia","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.5999,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.69810206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"81","issue":"8","first_page":"3200","last_page":"3216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8110207319259644},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7943382263183594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7009515762329102},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6273293495178223},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6216608881950378},{"id":"https://openalex.org/keywords/orientation","display_name":"Orientation (vector space)","score":0.5952857732772827},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5815215110778809},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5769773125648499},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4659140408039093},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4643761217594147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46384814381599426},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44989436864852905},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44194677472114563},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4339289963245392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12561103701591492},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09893104434013367}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8110207319259644},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7943382263183594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7009515762329102},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6273293495178223},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6216608881950378},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.5952857732772827},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5815215110778809},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5769773125648499},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4659140408039093},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4643761217594147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46384814381599426},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44989436864852905},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44194677472114563},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4339289963245392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12561103701591492},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09893104434013367},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-019-00580-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00580-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00580-x.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:200957","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/eeea11aa-313d-4a7a-933a-29d2e85f67ef","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/eeea11aa-313d-4a7a-933a-29d2e85f67ef","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R, Feldmann, A E & Such\u00fd, O 2019, 'A tight lower bound for planar Steiner Orientation', Algorithmica, vol. 81, no. 8, pp. 3200-3216. https://doi.org/10.1007/s00453-019-00580-x","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/eeea11aa-313d-4a7a-933a-29d2e85f67ef","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85065334356&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis , R , Feldmann , A E & Such\u00fd , O 2019 , ' A tight lower bound for planar Steiner Orientation ' , Algorithmica , vol. 81 , no. 8 , pp. 3200-3216 . https://doi.org/10.1007/s00453-019-00580-x","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00580-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00580-x","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00580-x.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1082698598","display_name":null,"funder_award_id":"UNCE/SCI/004","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G1409891256","display_name":null,"funder_award_id":"Czechia","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"id":"https://openalex.org/G2901580574","display_name":null,"funder_award_id":"17-20065S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G3618012969","display_name":null,"funder_award_id":"UNCE/SCI/004","funder_id":"https://openalex.org/F4320309755","funder_display_name":"Univerzita Karlova v Praze"},{"id":"https://openalex.org/G5566021001","display_name":null,"funder_award_id":"P202/12/G061","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320309755","display_name":"Univerzita Karlova v Praze","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320320279","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86"},{"id":"https://openalex.org/F4320320946","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2944399784.pdf","grobid_xml":"https://content.openalex.org/works/W2944399784.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W1577731219","https://openalex.org/W1586632891","https://openalex.org/W1975918326","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2069519792","https://openalex.org/W2125585605","https://openalex.org/W2130190334","https://openalex.org/W2150004999","https://openalex.org/W2162561603","https://openalex.org/W2167815360","https://openalex.org/W2228622483","https://openalex.org/W2335132016","https://openalex.org/W2461430093","https://openalex.org/W2576456765","https://openalex.org/W2799211099","https://openalex.org/W2799833205","https://openalex.org/W2804655966","https://openalex.org/W2914414140","https://openalex.org/W2949765771","https://openalex.org/W2962884946","https://openalex.org/W2963340170","https://openalex.org/W2963439929","https://openalex.org/W2989902795"],"related_works":["https://openalex.org/W2108770488","https://openalex.org/W2900469667","https://openalex.org/W3131610618","https://openalex.org/W306252662","https://openalex.org/W2963232826","https://openalex.org/W2952055179","https://openalex.org/W2733367155","https://openalex.org/W4298172280","https://openalex.org/W4302786124","https://openalex.org/W2569915728"],"abstract_inverted_index":{"In":[0,166],"the":[1,5,36,65,79,86,116,138,149,177,189,198,207,277,286,299,306],"Steiner":[2,66,117,150,200,258],"Orientation":[3,67,118,151,201,259],"problem,":[4],"input":[6,190],"is":[7,31,45,69,120,184,192,203,250,305],"a":[8,20,40,46,74,126,171,230],"mixed":[9],"graph":[10,191],"G":[11],"(it":[12],"has":[13],"both":[14],"directed":[15,47],"and":[16,19,60,110,146,173,238,240],"undirected":[17,37],"edges)":[18],"set":[21],"of":[22,88,128,143,180,210,235,301],"k":[23,209,281],"terminal":[24,53,211],"pairs":[25,282,295],"$$\\mathscr":[26],"{T}$$":[27,57],".":[28,58,84,108],"The":[29],"question":[30],"whether":[32],"we":[33,169,195,243],"can":[34,274],"orient":[35],"edges":[38],"in":[39,101,219,265],"way":[41],"such":[42,255],"that":[43,64,115,136,176,197,248,256],"there":[44,249],"$$s\\leadsto":[48],"t$$":[49],"path":[50],"for":[51,78,104,161,223],"each":[52],"pair":[54],"$$(s,t)\\in":[55],"\\mathscr":[56],"Arkin":[59],"Hassin":[61],"[DAM\u201902]":[62],"showed":[63,114],"problem":[68,119,152,202],"NP-complete.":[70],"They":[71],"also":[72],"gave":[73],"polynomial":[75],"time":[76,103,222,272],"algorithm":[77,99,160,179,273],"special":[80],"case":[81,278,287],"when":[82,279,288],"$$k=2$$":[83],"From":[85],"viewpoint":[87],"exact":[89],"algorithms,":[90],"Cygan":[91,181],"et":[92,182],"al.":[93,183],"[ESA\u201912,":[94],"SIDMA\u201913]":[95],"designed":[96],"an":[97,156,261],"XP":[98],"running":[100],"$$n^{O(k)}$$":[102,178],"all":[105,280],"$$k\\ge":[106],"1$$":[107],"Pilipczuk":[109],"Wahlstr\u00f6m":[111],"[SODA\u201916,":[112],"TOCT\u201918]":[113],"W[1]-hard":[121,204],"parameterized":[122,205],"by":[123,206],"k.":[124],"As":[125],"byproduct":[127],"their":[129],"reduction,":[130],"they":[131],"were":[132],"able":[133,245],"to":[134,246],"show":[135,196,247],"under":[137,214,229],"Exponential":[139],"Time":[140],"Hypothesis":[141],"(ETH)":[142],"Impagliazzo,":[144],"Paturi":[145],"Zane":[147],"[JCSS\u201901]":[148],"does":[153],"not":[154],"admit":[155],"$$f(k)\\cdot":[157,220,270],"n^{o(k/\\log":[158],"k)}$$":[159],"any":[162,224],"computable":[163,225],"function":[164,226],"f.":[165,227],"this":[167,304],"paper,":[168],"give":[170],"short":[172],"easy":[174],"proof":[175],"asymptotically":[185],"optimal,":[186],"even":[187],"if":[188],"planar.":[193],"Formally,":[194],"Planar":[199,257],"number":[208],"pairs,":[212],"and,":[213],"ETH,":[215],"cannot":[216],"be":[217],"solved":[218],"n^{o(k)}$$":[221,271],"Moreover,":[228],"stronger":[231],"hypothesis":[232],"called":[233],"Gap-ETH":[234],"Dinur":[236],"[ECCC\u201916]":[237],"Manurangsi":[239],"Raghavendra":[241],"[ICALP\u201917],":[242],"are":[244,283,296],"no":[251,269],"constant":[252],"$$\\vartheta":[253],">0$$":[254],"admits":[260],"$$(\\frac{19}{20}+\\vartheta":[262],")$$":[263,294],"-approximation":[264],"FPT":[266,308],"time,":[267],"i.e.,":[268],"distinguish":[275],"between":[276],"satisfiable":[284],"versus":[285],"less":[289],"than":[290],"$$k":[291],"\\cdot":[292],"(\\frac{19}{20}+\\vartheta":[293],"satisfiable.":[297],"To":[298],"best":[300],"our":[302],"knowledge,":[303],"first":[307],"inapproximability":[309],"result":[310],"on":[311],"planar":[312],"graphs.":[313]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}