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

DOI10.1007/11496915_8MaRDI QIDQ3596341zbMATH OpenOpenAlexFDO

Authors 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) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Paths and cycles (05C38) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)

Recommendations

• Approximability of unsplittable shortest path routing problems
• On the single-source unsplittable flow problem
• scientific article; zbMATH DE number 1947385
• Approximation algorithms for single-source unsplittable flow
• The \(k\)-splittable flow problem

Cited in

(8)

• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• An integer programming algorithm for routing optimization in IP networks
• An Integer Programming Algorithm for Routing Optimization in IP Networks
• Approximability of unsplittable shortest path routing problems
• Optimization of OSPF routing in IP networks
• Routing and capacity optimization for IP networks
• Routing and capacity optimization for IP networks
• Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596341)