Traveling with a Pez Dispenser (or, Routing Issues in MPLS)

DOI10.1137/S0097539702409927zbMath1087.68013MaRDI QIDQ4651544

Rajeev Rastogi, Amit Kumar, Anupam Gupta

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsnetwork routinggraph separatorsdistance labelingtree coversMPLS routing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of graph theory (05C90) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Network protocols (68M12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (19)

Collective tree spanners in graphs with bounded parameters ⋮ Additive Spanners for Circle Graphs and Polygonal Graphs ⋮ Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs ⋮ Metric Embedding via Shortest Path Decompositions ⋮ Covering metric spaces by few trees ⋮ Compact and low delay routing labeling scheme for unit disk graphs ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ A note on exact distance labeling ⋮ GMPLS label space minimization through hypergraph layouts ⋮ Collective additive tree spanners for circle graphs and polygonal graphs ⋮ Spanners in sparse graphs ⋮ Routing in unit disk graphs ⋮ On the advice complexity of the \(k\)-server problem under sparse metrics ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ Collective Additive Tree Spanners of Homogeneously Orderable Graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Covering Metric Spaces by Few Trees ⋮ Local Fast Segment Rerouting on Hypercubes ⋮ On Advice Complexity of the k-server Problem under Sparse Metrics

This page was built for publication: Traveling with a Pez Dispenser (or, Routing Issues in MPLS)