{"id":"https://openalex.org/W2289848075","doi":"https://doi.org/10.1142/s0218195915500144","title":"A Bottleneck Matching Problem with Edge-Crossing Constraints","display_name":"A Bottleneck Matching Problem with Edge-Crossing Constraints","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2289848075","doi":"https://doi.org/10.1142/s0218195915500144","mag":"2289848075"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195915500144","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195915500144","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5037655025","display_name":"John Gunnar Carlsson","orcid":"https://orcid.org/0000-0001-5346-8529"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John Gunnar Carlsson","raw_affiliation_strings":["Epstein Department of Industrial and Systems Engineering, University of Southern California, 3715 McClintock Ave, Los Angeles, California 90089-0193, USA"],"affiliations":[{"raw_affiliation_string":"Epstein Department of Industrial and Systems Engineering, University of Southern California, 3715 McClintock Ave, Los Angeles, California 90089-0193, USA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081046311","display_name":"Benjamin Armbruster","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Armbruster","raw_affiliation_strings":["Department of Industrial Engineering and Management Sciences, Northwestern University, 2145 Sheridan Road, Evanston, Illinois 60208, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management Sciences, Northwestern University, 2145 Sheridan Road, Evanston, Illinois 60208, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056922950","display_name":"Saladi Rahul","orcid":"https://orcid.org/0000-0001-5984-0934"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saladi Rahul","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, 200 Union Street Southeast, Minneapolis, Minnesota 55455, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, 200 Union Street Southeast, Minneapolis, Minnesota 55455, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081406176","display_name":"Haritha Bellam","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haritha Bellam","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, 200 Union Street Southeast, Minneapolis, Minnesota 55455, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, 200 Union Street Southeast, Minneapolis, Minnesota 55455, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5037655025"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":1.6641,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86677784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"04","first_page":"245","last_page":"261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/mathematics","display_name":"Mathematics","score":0.7692986726760864},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7121320962905884},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5867321491241455},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.582819402217865},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5529883503913879},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.452667772769928},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4371457099914551},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42348572611808777},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12490957975387573}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7692986726760864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7121320962905884},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5867321491241455},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.582819402217865},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5529883503913879},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.452667772769928},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4371457099914551},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42348572611808777},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12490957975387573},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195915500144","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195915500144","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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":10,"referenced_works":["https://openalex.org/W1524296966","https://openalex.org/W1903344008","https://openalex.org/W1981505946","https://openalex.org/W1990566310","https://openalex.org/W2002163559","https://openalex.org/W2046954049","https://openalex.org/W2066577300","https://openalex.org/W2069815120","https://openalex.org/W2076214941","https://openalex.org/W2127145740"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2804963084","https://openalex.org/W2898827770","https://openalex.org/W2151412766","https://openalex.org/W4295884766"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"a":[2,8,36,54,74,114],"crane":[3],"assignment":[4],"problem,":[5],"we":[6,32],"consider":[7],"Euclidean":[9],"bipartite":[10],"matching":[11,38],"problem":[12,68,95],"with":[13],"edge-crossing":[14],"constraints.":[15],"Specifically,":[16],"given":[17],"[Formula:":[18,24,83],"see":[19,25,84],"text]":[20,26],"red":[21,40,106,123,140],"points":[22,28,43,109,124,130],"and":[23,41,107,117,127],"blue":[27,42,108,129],"in":[29,79,96],"the":[30,46,49,67,102,105,111,119,122,128,136,139],"plane,":[31],"want":[33],"to":[34,132],"construct":[35],"perfect":[37],"between":[39],"that":[44,56,66,92],"minimizes":[45],"length":[47],"of":[48,113,135],"longest":[50],"edge,":[51],"while":[52],"imposing":[53],"constraint":[55],"no":[57],"two":[58,97],"edges":[59],"may":[60],"cross":[61],"each":[62],"other.":[63],"We":[64,86],"show":[65],"cannot":[69],"be":[70],"approximately":[71],"solved":[72],"within":[73],"factor":[75],"less":[76],"than":[77],"1:277":[78],"polynomial":[80],"time":[81],"unless":[82],"text].":[85],"give":[87],"simple":[88],"dynamic":[89],"programming":[90],"algorithms":[91],"solve":[93],"our":[94],"special":[98],"cases,":[99],"namely":[100],"(1)":[101],"case":[103,120],"where":[104,121],"form":[110],"vertices":[112],"convex":[115],"polygon":[116],"(2)":[118],"are":[125],"collinear":[126],"lie":[131],"one":[133],"side":[134],"line":[137],"through":[138],"points.":[141]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}