Routing Complexity
Routing Complexity is a computational metric that quantifies the algorithmic intricacy and resource overhead involved in determining optimal paths within a network, distinguishing itself from related performance measures by focusing specifically on the inherent difficulty of the routing computation process rather than on transmission efficiency or network topology alone.
127
Publications
6.1K
Citations
276
Authors
154
Institutions
Publications per year
2017–2026
14
Parents
127
Complexity of vehicle routing and scheduling problems
Jan Karel Lenstra, A. H. G. Rinnooy Kan · Networks · 1981 · 1.3K citations
1–5 of 127
276
7
h-index
5
h-index
5
h-index
3
h-index
IBM Research - Thomas J. Watson Research Center, United States
3 publications · 54 citations
3
h-index
1–5 of 276
154
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
10 publications
314 citations
Université de Bordeaux
Bordeaux, France
7 h-index
7 publications
344 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
10 publications
164 citations
Purdue University West Lafayette
West Lafayette, United States
5 h-index
7 publications
219 citations
Tsinghua University
Beijing, China
5 h-index
18 publications
264 citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
12 publications
764 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
5 h-index
5 publications
190 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
9 publications
261 citations
1–8 of 154
8 publications · 257 citations
8
h-index
TON · 8 publications · 603 citations
8
h-index
4 publications · 128 citations
4
h-index
4 publications · 123 citations
4
h-index
TALG · 3 publications · 153 citations
3
h-index
1–5