{"id":"https://openalex.org/W1663464721","doi":"https://doi.org/10.1145/3299903","title":"Strong Steiner Tree Approximations in Practice","display_name":"Strong Steiner Tree Approximations in Practice","publication_year":2019,"publication_date":"2019-01-30","ids":{"openalex":"https://openalex.org/W1663464721","doi":"https://doi.org/10.1145/3299903","mag":"1663464721"},"language":"en","primary_location":{"id":"doi:10.1145/3299903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299903","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1409.8318","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070933269","display_name":"Stephan Beyer","orcid":"https://orcid.org/0000-0001-5274-0447"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stephan Beyer","raw_affiliation_strings":["Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany","Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-5274-0447","affiliations":[{"raw_affiliation_string":"Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]},{"raw_affiliation_string":"Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany#TAB#","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044475263","display_name":"Markus Chimani","orcid":"https://orcid.org/0000-0002-4681-5550"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Chimani","raw_affiliation_strings":["Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany","Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-4681-5550","affiliations":[{"raw_affiliation_string":"Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]},{"raw_affiliation_string":"Osnabr\u00fcck University, Wachsbleiche, Osnabr\u00fcck, Germany#TAB#","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00059226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"33"},"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.9997000098228455,"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.9997000098228455,"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.9990000128746033,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8256089687347412},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5561305284500122},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.533364474773407},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.517932116985321},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5073208212852478},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.48826146125793457},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4667964577674866},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4539468288421631},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4392528235912323},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4228900372982025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4018746316432953},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3997349739074707},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3798920512199402},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3780486583709717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3310924768447876}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8256089687347412},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5561305284500122},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.533364474773407},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.517932116985321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5073208212852478},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.48826146125793457},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4667964577674866},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4539468288421631},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4392528235912323},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4228900372982025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4018746316432953},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3997349739074707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3798920512199402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3780486583709717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3310924768447876},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3299903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3299903","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1409.8318","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8318","pdf_url":"https://arxiv.org/pdf/1409.8318","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},{"id":"mag:1663464721","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1409.8318.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.740.9564","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.740.9564","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1409.8318.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1409.8318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1409.8318","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1409.8318","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8318","pdf_url":"https://arxiv.org/pdf/1409.8318","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1560469704","display_name":null,"funder_award_id":"CH 897/1-1 and CH 897/3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1663464721.pdf","grobid_xml":"https://content.openalex.org/works/W1663464721.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W113862924","https://openalex.org/W119908148","https://openalex.org/W124060458","https://openalex.org/W1185775471","https://openalex.org/W1481847403","https://openalex.org/W1485792125","https://openalex.org/W1519758470","https://openalex.org/W1535706250","https://openalex.org/W1536662328","https://openalex.org/W1598916021","https://openalex.org/W1608030126","https://openalex.org/W1637986482","https://openalex.org/W1849829953","https://openalex.org/W1928219016","https://openalex.org/W1975290397","https://openalex.org/W1976584101","https://openalex.org/W1979269423","https://openalex.org/W1990317614","https://openalex.org/W1996668544","https://openalex.org/W1997126046","https://openalex.org/W2001139415","https://openalex.org/W2003272551","https://openalex.org/W2003882909","https://openalex.org/W2007503572","https://openalex.org/W2007572995","https://openalex.org/W2008534472","https://openalex.org/W2008771115","https://openalex.org/W2011999472","https://openalex.org/W2012130001","https://openalex.org/W2020586530","https://openalex.org/W2027515293","https://openalex.org/W2031130839","https://openalex.org/W2032228390","https://openalex.org/W2039298646","https://openalex.org/W2040579873","https://openalex.org/W2042788891","https://openalex.org/W2068362339","https://openalex.org/W2070664846","https://openalex.org/W2078008627","https://openalex.org/W2078404396","https://openalex.org/W2082150701","https://openalex.org/W2086709935","https://openalex.org/W2115616619","https://openalex.org/W2121370879","https://openalex.org/W2122195804","https://openalex.org/W2137120608","https://openalex.org/W2140055763","https://openalex.org/W2155239253","https://openalex.org/W2169528473","https://openalex.org/W2218699483","https://openalex.org/W2395552018","https://openalex.org/W2401610261","https://openalex.org/W2522051431","https://openalex.org/W2950024286","https://openalex.org/W2963552748","https://openalex.org/W3127447045","https://openalex.org/W6602249631"],"related_works":["https://openalex.org/W2165571569","https://openalex.org/W2626895439","https://openalex.org/W2950503629","https://openalex.org/W2885672520","https://openalex.org/W3011600946","https://openalex.org/W2593136533","https://openalex.org/W205389003","https://openalex.org/W3204294665","https://openalex.org/W2019648557","https://openalex.org/W2400225133","https://openalex.org/W2260245503","https://openalex.org/W2401945280","https://openalex.org/W1526313893","https://openalex.org/W2949500196","https://openalex.org/W1988624553","https://openalex.org/W3158958986","https://openalex.org/W2967113596","https://openalex.org/W2951674151","https://openalex.org/W2979856667","https://openalex.org/W2548758807"],"abstract_inverted_index":{"In":[0],"this":[1],"experimental":[2],"study,":[3],"we":[4],"consider":[5],"Steiner":[6],"tree":[7],"approximation":[8,14,50],"algorithms":[9,22,92,101],"that":[10,86],"guarantee":[11],"a":[12],"constant":[13],"ratio":[15],"smaller":[16],"than":[17],"2.":[18],"The":[19],"considered":[20],"greedy":[21],"and":[23,83,114,117],"approaches":[24],"based":[25,109],"on":[26,67,110],"linear":[27,112],"programming":[28],"involve":[29],"the":[30,45,60,100],"incorporation":[31],"of":[32,44],"k":[33,39,56,68,73],"-restricted":[34],"full":[35],"components":[36],"for":[37,55,95],"some":[38],"\u2265":[40],"3.":[41],"For":[42],"most":[43],"algorithms,":[46],"their":[47],"strongest":[48],"theoretical":[49],"bounds":[51],"are":[52,74],"only":[53,71],"achieved":[54],"\u2192":[57],"\u221e.":[58],"However,":[59],"running":[61],"time":[62],"is":[63],"also":[64],"exponentially":[65],"dependent":[66],",":[69],"so":[70],"small":[72],"tractable":[75],"in":[76],"practice.":[77],"We":[78,98],"investigate":[79],"different":[80],"implementation":[81],"aspects":[82],"parameter":[84],"choices":[85],"finally":[87],"allow":[88],"us":[89],"to":[90,105,115],"construct":[91],"(somewhat)":[93],"feasible":[94],"practical":[96],"use.":[97],"compare":[99],"against":[102],"each":[103],"other,":[104],"an":[106],"exact":[107],"algorithm":[108],"integer":[111],"programs,":[113],"fast":[116],"simple":[118],"2-approximations":[119],"as":[120,122],"well":[121],"state-of-the-art":[123],"heuristics.":[124]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}