On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem

DOI10.1007/11496915_8zbMath1119.90065OpenAlexW1482811544MaRDI QIDQ3596341

Andreas Bley

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496915_8

zbMATH Keywords

ApproximationComputational ComplexityShortest Path RoutingUnsplittable Flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Paths and cycles (05C38) Traffic problems in operations research (90B20)

Related Items (5)

An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ Routing and Capacity Optimization for IP Networks ⋮ Approximability of unsplittable shortest path routing problems ⋮ A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion ⋮ Optimization of OSPF Routing in IP Networks

This page was built for publication: On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem