The complexity of shortest path and dilation bounded interval routing
type: Item
instance of: scholarly article
title: The complexity of shortest path and dilation bounded interval routing
zbMATH Open document ID: 0947.68002
DOI: 10.1016/S0304-3975(98)00042-5
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1493451
zbMATH Keywords: compact routing
zbMATH Keywords: dilation bounded interval routing
zbMATH Keywords: complexity
author: Rastislav Královič
author: Peter Ružička
author: D. Štefankovič
MaRDI profile type: Publication
cites work: Q4262693
cites work: The complexity of interval routing on random graphs
cites work: A characterization of networks supporting linear interval routing
cites work: Interval routing schemes
cites work: Lower bounds for compact routing
cites work: Deterministic routing with bounded buffers: turning offline into online protocols
cites work: A trade-off between space and efficiency for routing tables
cites work: Q3815249
cites work: Labelling and Implicit Routing in Networks
cites work: Q4345573
cites work: Interval Routing
full work available at URL: s0304-3975(98)00042-5
OpenAlex ID: W2044606924
Wikidata QID: Q126551847
description: scientific article; zbMATH DE number 1493451