{"id":"https://openalex.org/W4412202024","doi":"https://doi.org/10.1145/3747591","title":"Minimum Plane Bichromatic Spanning Trees","display_name":"Minimum Plane Bichromatic Spanning Trees","publication_year":2025,"publication_date":"2025-07-11","ids":{"openalex":"https://openalex.org/W4412202024","doi":"https://doi.org/10.1145/3747591"},"language":"en","primary_location":{"id":"doi:10.1145/3747591","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3747591","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021328602","display_name":"Hugo A. Akitaya","orcid":"https://orcid.org/0000-0002-6827-2200"},"institutions":[{"id":"https://openalex.org/I133738476","display_name":"University of Massachusetts Lowell","ror":"https://ror.org/03hamhx47","country_code":"US","type":"education","lineage":["https://openalex.org/I133738476"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hugo A. Akitaya","raw_affiliation_strings":["University of Massachusetts Lowell, Lowell, Massachusetts, USA","University of Massachusetts Lowell, USA"],"raw_orcid":"https://orcid.org/0000-0002-6827-2200","affiliations":[{"raw_affiliation_string":"University of Massachusetts Lowell, Lowell, Massachusetts, USA","institution_ids":["https://openalex.org/I133738476"]},{"raw_affiliation_string":"University of Massachusetts Lowell, USA","institution_ids":["https://openalex.org/I133738476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015212072","display_name":"Ahmad Biniaz","orcid":"https://orcid.org/0000-0002-6396-4494"},"institutions":[{"id":"https://openalex.org/I74413500","display_name":"University of Windsor","ror":"https://ror.org/01gw3d370","country_code":"CA","type":"education","lineage":["https://openalex.org/I74413500"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ahmad Biniaz","raw_affiliation_strings":["University of Windsor, Windsor, Ontario, Canada","University of Windsor, Canada"],"raw_orcid":"https://orcid.org/0000-0002-6396-4494","affiliations":[{"raw_affiliation_string":"University of Windsor, Windsor, Ontario, Canada","institution_ids":["https://openalex.org/I74413500"]},{"raw_affiliation_string":"University of Windsor, Canada","institution_ids":["https://openalex.org/I74413500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts, USA","Massachusetts Institute of Technology, USA"],"raw_orcid":"https://orcid.org/0000-0003-3803-5703","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090048794","display_name":"Linda Kleist","orcid":"https://orcid.org/0000-0002-3786-916X"},"institutions":[{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Linda Kleist","raw_affiliation_strings":["Universit\u00e4t Potsdam, Potsdam, Germany","Universit\u00e4t Potsdam, Germany"],"raw_orcid":"https://orcid.org/0000-0002-3786-916X","affiliations":[{"raw_affiliation_string":"Universit\u00e4t Potsdam, Potsdam, Germany","institution_ids":["https://openalex.org/I176453806"]},{"raw_affiliation_string":"Universit\u00e4t Potsdam, Germany","institution_ids":["https://openalex.org/I176453806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020369962","display_name":"Frederick Stock","orcid":null},"institutions":[{"id":"https://openalex.org/I133738476","display_name":"University of Massachusetts Lowell","ror":"https://ror.org/03hamhx47","country_code":"US","type":"education","lineage":["https://openalex.org/I133738476"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Frederick Stock","raw_affiliation_strings":["University of Massachusetts Lowell, Lowell, Massachusetts, USA","University of Massachusetts Lowell, USA"],"raw_orcid":"https://orcid.org/0009-0008-9005-6855","affiliations":[{"raw_affiliation_string":"University of Massachusetts Lowell, Lowell, Massachusetts, USA","institution_ids":["https://openalex.org/I133738476"]},{"raw_affiliation_string":"University of Massachusetts Lowell, USA","institution_ids":["https://openalex.org/I133738476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030799674","display_name":"Csaba D. T\u00f3th","orcid":"https://orcid.org/0000-0002-8769-3190"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]},{"id":"https://openalex.org/I157638225","display_name":"California State University, Northridge","ror":"https://ror.org/005f5hv41","country_code":"US","type":"education","lineage":["https://openalex.org/I157638225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Csaba D. T\u00f3th","raw_affiliation_strings":["California State University Northridge, Northridge, California, USA and Tufts University, Medford, Massachusetts, USA","California State University Northridge, USA and Tufts University, USA"],"raw_orcid":"https://orcid.org/0000-0002-8769-3190","affiliations":[{"raw_affiliation_string":"California State University Northridge, Northridge, California, USA and Tufts University, Medford, Massachusetts, USA","institution_ids":["https://openalex.org/I157638225"]},{"raw_affiliation_string":"California State University Northridge, USA and Tufts University, USA","institution_ids":["https://openalex.org/I157638225","https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17051483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"4","first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973000288009644,"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/spanning-tree","display_name":"Spanning tree","score":0.630859911441803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6112799644470215},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5400619506835938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5228681564331055},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.49497073888778687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3650965094566345},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33093538880348206},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.3214626908302307},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19966435432434082}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.630859911441803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6112799644470215},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5400619506835938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5228681564331055},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.49497073888778687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3650965094566345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33093538880348206},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.3214626908302307},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19966435432434082}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3747591","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3747591","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W4368930","https://openalex.org/W1001549597","https://openalex.org/W1556128689","https://openalex.org/W1557776940","https://openalex.org/W1965680834","https://openalex.org/W1967661673","https://openalex.org/W1972830235","https://openalex.org/W2010584162","https://openalex.org/W2013115769","https://openalex.org/W2017927472","https://openalex.org/W2024937369","https://openalex.org/W2030563429","https://openalex.org/W2042473201","https://openalex.org/W2047142187","https://openalex.org/W2068020662","https://openalex.org/W2074574297","https://openalex.org/W2083530426","https://openalex.org/W2116680937","https://openalex.org/W2125861228","https://openalex.org/W2148015778","https://openalex.org/W2165142526","https://openalex.org/W2555258613","https://openalex.org/W2570514658","https://openalex.org/W2593486311","https://openalex.org/W2775046532","https://openalex.org/W2972310057","https://openalex.org/W3105254162","https://openalex.org/W3170855457","https://openalex.org/W3190359733","https://openalex.org/W3194433112","https://openalex.org/W3204001899","https://openalex.org/W4233215936","https://openalex.org/W4237276646","https://openalex.org/W4241946002","https://openalex.org/W4247889263","https://openalex.org/W4250775990","https://openalex.org/W4303982821","https://openalex.org/W4317393661","https://openalex.org/W4412273869","https://openalex.org/W6604464661"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4296605418","https://openalex.org/W4385493656","https://openalex.org/W4389325756","https://openalex.org/W4301179398","https://openalex.org/W4286893801","https://openalex.org/W2066857130","https://openalex.org/W2382032469","https://openalex.org/W4308416203","https://openalex.org/W2487945693"],"abstract_inverted_index":{"For":[0],"a":[1,11,18,30,33,66,79,108,117,144],"set":[2],"of":[3,22,52,99,106,146],"red":[4,31],"and":[5,32,93],"blue":[6,34],"points":[7,24,171],"in":[8,41,160,163,173],"the":[9,23,50,57,96,104,154,170,195],"plane,":[10],"Minimum":[12,109],"Bichromatic":[13,111],"Spanning":[14,112],"Tree":[15,113],"(MinBST)":[16],"is":[17,49,62,81,116,128,150],"shortest":[19,118],"spanning":[20,120],"tree":[21,121],"such":[25],"that":[26,71,78,83,153],"every":[27],"edge":[28],"has":[29,143,183],"endpoint.":[35],"A":[36],"MinBST":[37,67,80],"can":[38,157],"be":[39,131,158],"computed":[40,159],"\\(O(n\\log":[42],"n)\\)":[43,190],"time":[44,162],"where":[45],"\\(":[46],"n":[47],"\\)":[48],"number":[51,98],"points.":[53],"In":[54],"contrast":[55],"to":[56,130,139],"standard":[58],"Euclidean":[59],"MST,":[60],"which":[61,115],"always":[63],"plane":[64],"(noncrossing),":[65],"may":[68],"have":[69],"edges":[70],"cross":[72],"each":[73],"other.":[74],"However,":[75],"we":[76,94,102],"prove":[77],"quasi-plane,":[82],"is,":[84],"it":[85],"does":[86],"not":[87],"contain":[88],"three":[89],"pairwise":[90,123],"crossing":[91],"edges,":[92],"determine":[95],"maximum":[97],"crossings.":[100],"Moreover,":[101],"study":[103],"problem":[105,127],"finding":[107],"Plane":[110],"(MinPBST)":[114],"bichromatic":[119],"with":[122],"noncrossing":[124],"edges.":[125],"This":[126],"known":[129,152],"NP-hard.":[132],"The":[133],"previous":[134],"best":[135],"approximation":[136,192],"algorithm,":[137],"due":[138],"Borgelt":[140],"et":[141],"al.,":[142],"ratio":[145],"\\(O(\\sqrt{n})\\)":[147],".":[148],"It":[149],"also":[151],"optimum":[155],"solution":[156],"polynomial":[161],"some":[164],"special":[165],"cases,":[166],"for":[167,194],"instance,":[168],"when":[169,179],"are":[172],"convex":[174],"position,":[175],"collinear,":[176],"semi-collinear,":[177],"or":[178],"one":[180],"color":[181],"class":[182],"constant":[184],"size.":[185],"We":[186],"present":[187],"an":[188],"\\(O(\\log":[189],"-factor":[191],"algorithm":[193],"general":[196],"case.":[197]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}