{"id":"https://openalex.org/W1630936144","doi":"https://doi.org/10.37236/1853","title":"Rectilinear Spanning Trees Versus Bounding Boxes","display_name":"Rectilinear Spanning Trees Versus Bounding Boxes","publication_year":2004,"publication_date":"2004-08-13","ids":{"openalex":"https://openalex.org/W1630936144","doi":"https://doi.org/10.37236/1853","mag":"1630936144"},"language":"en","primary_location":{"id":"doi:10.37236/1853","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1853","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1n12/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1n12/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032828042","display_name":"Dieter Rautenbach","orcid":"https://orcid.org/0000-0002-7214-042X"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"D. Rautenbach","raw_affiliation_strings":["Forschungsinstitut fr Diskrete Mathematik, Universitt Bonn Lennstrasse 2, 53113 Bonn, Germany","Forschungsinstitut f\u00fcr Diskrete Mathematik, Universit\u00e4t Bonn Lenn\u00e9strasse 2, 53113 Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Forschungsinstitut fr Diskrete Mathematik, Universitt Bonn Lennstrasse 2, 53113 Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Forschungsinstitut f\u00fcr Diskrete Mathematik, Universit\u00e4t Bonn Lenn\u00e9strasse 2, 53113 Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032828042"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.06537771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9911999702453613,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9123575687408447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.850740909576416},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7104933261871338},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6977911591529846},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4681945741176605},{"id":"https://openalex.org/keywords/perimeter","display_name":"Perimeter","score":0.4662647843360901},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44711583852767944},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4324287474155426},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12368446588516235},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06258004903793335}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9123575687408447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.850740909576416},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7104933261871338},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6977911591529846},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4681945741176605},{"id":"https://openalex.org/C98503990","wikidata":"https://www.wikidata.org/wiki/Q28474","display_name":"Perimeter","level":2,"score":0.4662647843360901},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44711583852767944},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4324287474155426},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12368446588516235},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06258004903793335},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/1853","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1853","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1n12/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/1853","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1853","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v11i1n12/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1630936144.pdf","grobid_xml":"https://content.openalex.org/works/W1630936144.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2040257225","https://openalex.org/W2069712919","https://openalex.org/W2151977393","https://openalex.org/W2162272700"],"related_works":["https://openalex.org/W2147388254","https://openalex.org/W4252687944","https://openalex.org/W1993940507","https://openalex.org/W315834793","https://openalex.org/W1515822898","https://openalex.org/W2569968971","https://openalex.org/W4290343790","https://openalex.org/W3082270022","https://openalex.org/W2096398399","https://openalex.org/W4214717099"],"abstract_inverted_index":{"For":[0],"a":[1,27,59],"set":[2],"$P\\subseteq":[3],"{\\Bbb":[4],"R}^2$":[5],"with":[6],"$2\\leq":[7],"n=|P|":[8],"<":[9],"\\infty$":[10],"we":[11],"prove":[12],"that":[13,61],"${{\\rm":[14],"mst}(P)\\over{\\rm":[15],"bb}(P)}":[16],"\\leq{1\\over\\sqrt{2}}\\sqrt{n}+{3\\over2}$":[17],"where":[18],"${\\rm":[19,34],"mst}(P)$":[20],"is":[21,36,54],"the":[22,38,41,47,51],"minimum":[23],"total":[24],"length":[25],"of":[26,40,44],"rectilinear":[28],"spanning":[29],"tree":[30],"for":[31],"$P$":[32],"and":[33,66],"bb}(P)$":[35],"half":[37],"perimeter":[39],"bounding":[42],"box":[43],"$P$.":[45],"Since":[46],"constant":[48],"${1\\over\\sqrt{2}}$":[49],"in":[50],"above":[52],"bound":[53],"best-possible,":[55],"this":[56],"result":[57],"settles":[58],"problem":[60],"was":[62],"mentioned":[63],"by":[64],"Brenner":[65],"Vygen":[67],"(Networks":[68],"38":[69],"(2001),":[70],"126-139).":[71]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}