Internet routing between autonomous systems: fast algorithms for path trading

DOI10.1016/j.dam.2014.11.025zbMath1311.05046MaRDI QIDQ2341707

Heiko Röglin, Ruben van der Zwaan, André Berger

Publication date: 28 April 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.11.025

zbMATH Keywords

shortest paths; smoothed analysis; internet routing

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C35: Extremal problems in graph theory

05C82: Small world graphs, complex networks (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C12: Distance in graphs

68M11: Internet topics