On the complexity of compressing two dimensional routing tables with order
From MaRDI portal
Publication:1702127
DOI10.1007/s00453-016-0243-7zbMath1386.68070MaRDI QIDQ1702127
Frédéric Havet, Frederic Giroire, Joanna Moulierac
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01686641/file/compacting.pdf
complexity; approximation algorithm; order; priority; routing; software defined networks; routing tables; compact tables
68Q25: Analysis of algorithms and problem complexity
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
