{"id":"https://openalex.org/W2002419395","doi":"https://doi.org/10.1142/s0219265909002431","title":"(\u2113, k)-ROUTING ON PLANE GRIDS","display_name":"(\u2113, k)-ROUTING ON PLANE GRIDS","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2002419395","doi":"https://doi.org/10.1142/s0219265909002431","mag":"2002419395"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265909002431","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265909002431","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"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":"Journal of Interconnection Networks","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/A5063510852","display_name":"Florian Huc","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I4210150799","display_name":"Battelle","ror":"https://ror.org/05vqnxk73","country_code":"CH","type":"nonprofit","lineage":["https://openalex.org/I4210150799"]}],"countries":["AT","CH"],"is_corresponding":true,"raw_author_name":"FLORIAN HUC","raw_affiliation_strings":["Centre Universitaire d'Informatique, Battelle b\u00e2timent A, route de Drize 7, 1227 Carouge, Geneva, Switzerland","Algorithms, simulation, combinatorics and optimization for telecommunications"],"affiliations":[{"raw_affiliation_string":"Centre Universitaire d'Informatique, Battelle b\u00e2timent A, route de Drize 7, 1227 Carouge, Geneva, Switzerland","institution_ids":["https://openalex.org/I4210150799"]},{"raw_affiliation_string":"Algorithms, simulation, combinatorics and optimization for telecommunications","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025941213","display_name":"Ignasi Sau","orcid":"https://orcid.org/0000-0002-8981-9287"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES","FR"],"is_corresponding":false,"raw_author_name":"IGNASI SAU","raw_affiliation_strings":["Graph Theory and Combinatorics group, MA4, UPC, Barcelona, Spain","Mascotte Project, CNRS/INRIA/UNSA/I3S, 2004 route des Lucioles, B.P. 93 F-06902 Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"Graph Theory and Combinatorics group, MA4, UPC, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]},{"raw_affiliation_string":"Mascotte Project, CNRS/INRIA/UNSA/I3S, 2004 route des Lucioles, B.P. 93 F-06902 Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089379545","display_name":"Janez \u017derovnik","orcid":"https://orcid.org/0000-0002-6041-1106"},"institutions":[{"id":"https://openalex.org/I4210106342","display_name":"Institute of Mathematics, Physics, and Mechanics","ror":"https://ror.org/01eb3qa50","country_code":"SI","type":"facility","lineage":["https://openalex.org/I4210106342"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["AT","SI"],"is_corresponding":false,"raw_author_name":"JANEZ \u017dEROVNIK","raw_affiliation_strings":["FME, University of Ljubljana, A\u0161ker\u010deva 6, Ljubljana, Slovenia","Institute of Mathematics, Physics and Mechanics (IMFM), Jadranska 19, Ljubljana, Slovenia","Algorithms, simulation, combinatorics and optimization for telecommunications"],"affiliations":[{"raw_affiliation_string":"FME, University of Ljubljana, A\u0161ker\u010deva 6, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]},{"raw_affiliation_string":"Institute of Mathematics, Physics and Mechanics (IMFM), Jadranska 19, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I4210106342"]},{"raw_affiliation_string":"Algorithms, simulation, combinatorics and optimization for telecommunications","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063510852"],"corresponding_institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I4210150799"],"apc_list":null,"apc_paid":null,"fwci":0.6857,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70959044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"01n02","first_page":"27","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"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.9977999925613403,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.7756625413894653},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6898719072341919},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6528887748718262},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6352338790893555},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5814036130905151},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5773043036460876},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5560224652290344},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.5550795793533325},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.45952659845352173},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.42803773283958435},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.41027140617370605},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3766538202762604},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36983680725097656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3530943989753723},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1851828694343567}],"concepts":[{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.7756625413894653},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6898719072341919},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6528887748718262},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6352338790893555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5814036130905151},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5773043036460876},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5560224652290344},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.5550795793533325},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.45952659845352173},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.42803773283958435},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.41027140617370605},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3766538202762604},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36983680725097656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3530943989753723},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1851828694343567}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265909002431","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265909002431","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"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":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W1022217070","https://openalex.org/W1508101233","https://openalex.org/W1509884808","https://openalex.org/W1518210324","https://openalex.org/W1542292688","https://openalex.org/W1599925897","https://openalex.org/W1602659199","https://openalex.org/W1640956769","https://openalex.org/W1656481413","https://openalex.org/W1725954713","https://openalex.org/W1966506775","https://openalex.org/W1968358793","https://openalex.org/W1971443646","https://openalex.org/W1972824606","https://openalex.org/W1976150119","https://openalex.org/W1979112277","https://openalex.org/W1980907788","https://openalex.org/W1986061053","https://openalex.org/W1986832574","https://openalex.org/W1988294273","https://openalex.org/W1988357027","https://openalex.org/W1996875366","https://openalex.org/W2000768601","https://openalex.org/W2023702935","https://openalex.org/W2023927260","https://openalex.org/W2027063844","https://openalex.org/W2035665808","https://openalex.org/W2045283278","https://openalex.org/W2056557086","https://openalex.org/W2068862022","https://openalex.org/W2075514627","https://openalex.org/W2080283299","https://openalex.org/W2080750094","https://openalex.org/W2084427019","https://openalex.org/W2097338490","https://openalex.org/W2097755092","https://openalex.org/W2109573594","https://openalex.org/W2113322651","https://openalex.org/W2113633000","https://openalex.org/W2115375706","https://openalex.org/W2125667960","https://openalex.org/W2130058418","https://openalex.org/W2135992799","https://openalex.org/W2138063976","https://openalex.org/W2140385091","https://openalex.org/W2140773452","https://openalex.org/W2145818650","https://openalex.org/W2146711715","https://openalex.org/W2147199627","https://openalex.org/W2156867662","https://openalex.org/W2162050419","https://openalex.org/W2170832776","https://openalex.org/W2335502549","https://openalex.org/W2400200109","https://openalex.org/W2798588639","https://openalex.org/W4200557314","https://openalex.org/W4213272272","https://openalex.org/W4229713379","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2148093630","https://openalex.org/W4253436398","https://openalex.org/W1655019438","https://openalex.org/W2002267183","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W1984835167","https://openalex.org/W2351097701","https://openalex.org/W2556128816"],"abstract_inverted_index":{"The":[0],"packet":[1,80,136],"routing":[2,49,62,93,156,172],"problem":[3,245,251],"plays":[4],"an":[5],"essential":[6],"role":[7],"in":[8,132],"communication":[9],"networks.":[10,125],"It":[11],"involves":[12],"how":[13],"to":[14,20,77,81],"transfer":[15],"data":[16],"from":[17,71],"some":[18,21],"origins":[19],"destinations":[22],"within":[23],"a":[24,72,79,247],"reasonable":[25],"amount":[26],"of":[27,196,217],"time.":[28],"In":[29,59,83],"the":[30,51,60,88,91,95,114,129,133,151,214,242],"(\u2113,":[31,97,142,200,243],"k)-routing":[32,98,143,182,201,244],"problem,":[33,63],"each":[34,236],"node":[35,74],"can":[36,231],"send":[37,78],"at":[38,44,66,68,235],"most":[39,45,69],"\u2113":[40,54],"packets":[41],"and":[42,94,109,118,123,162,166,176,187,205],"receive":[43],"k":[46,56],"packets.":[47],"Permutation":[48],"is":[50,104],"particular":[52],"case":[53],"=":[55,57],"1.":[58,153],"r-central":[61,92,171],"all":[64,227],"nodes":[65],"distance":[67],"r":[70],"fixed":[73],"v":[75],"want":[76],"v.":[82],"this":[84],"article":[85],"we":[86,119,239],"study":[87],"permutation":[89,155],"routing,":[90,137],"general":[96],"problems":[99],"on":[100,141,144,158,174,184,202,213,252],"plane":[101,145],"grids,":[102,106,161,207],"that":[103],"square":[105],"triangular":[107,165,175,186,204],"grids":[108],"hexagonal":[110,160,167,177,188,206],"grids.":[111,146,168,178,189],"We":[112,126],"use":[113],"store-and-forward":[115],"\u0394-port":[116],"model,":[117],"consider":[120],"both":[121],"full":[122],"half-duplex":[124],"first":[127],"survey":[128],"existing":[130],"results":[131],"literature":[134],"about":[135],"with":[138,209],"special":[139],"emphasis":[140],"Our":[147],"main":[148],"contributions":[149],"are":[150,226],"following:":[152],"Tight":[154,170,180],"algorithms":[157,173,183,193,225],"full-duplex":[159],"half":[163],"duplex":[164],"2.":[169],"3.":[179],"(k,":[181],"square,":[185,203],"4.":[190],"Good":[191],"approximation":[192],"(in":[194],"terms":[195],"running":[197,215],"time)":[198],"for":[199],"together":[208],"new":[210],"lower":[211],"bounds":[212],"time":[216],"any":[218],"algorithm":[219],"using":[220],"shortest":[221],"path":[222],"routing.":[223],"These":[224],"completely":[228],"distributed,":[229],"i.e.,":[230],"be":[232],"implemented":[233],"independently":[234],"node.":[237],"Finally,":[238],"also":[240],"formulate":[241],"as":[246],"WEIGHTED":[248],"EDGE":[249],"COLORING":[250],"bipartite":[253],"graphs.":[254]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}