Approximating the \(k\)-splittable capacitated network design problem

DOI10.1016/j.disopt.2016.09.001zbMath1387.90053OpenAlexW2526045693MaRDI QIDQ1751198

Ehab Morsy

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.09.001

zbMATH Keywords

graph algorithmsapproximation algorithmsnetwork optimizationrouting problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (1)

Global optimization of multilevel electricity market models including network design and graph partitioning

Cites Work

• The \(k\)-splittable flow problem
• Approximation algorithms for a capacitated network design problem
• Balancing minimum spanning trees and shortest-path trees
• Approximating the Single-Sink Link-Installation Problem in Network Design
• An improved LP-based approximation for steiner tree
• Improved Approximation for Single-Sink Buy-at-Bulk

This page was built for publication: Approximating the \(k\)-splittable capacitated network design problem