On the complexity of equal shortest path routing
From MaRDI portal
Publication:4565765
DOI10.1002/net.21612zbMath1390.90162MaRDI QIDQ4565765
Stéphane Pérennes, Frederic Giroire, Issam Tahiri
Publication date: 13 June 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01218473/file/ospf-journal.pdf
shortest path; NP-hard; approximation algorithms; routing; maximum flow; \textsc{ospf-ecmp} protocol; inverse shortest path
90B18: Communication networks in operations research