Approximating the k-splittable capacitated network design problem

DOI10.1007/978-3-642-35843-2_30MaRDI QIDQ2927658zbMATH OpenOpenAlexFDO

Authors Ehab Morsy

Publication date 4 November 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35843-2_30

zbMATH Keywords

approximation algorithmgraph algorithmnetwork optimizationrouting problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximating the \(k\)-splittable capacitated network design problem
• Approximation algorithms for a capacitated network design problem
• Approximation schemes for capacitated geometric network design
• Approximation schemes for capacitated geometric network design
• scientific article; zbMATH DE number 1670539

Cited in

(4)

• Approximating the \(k\)-splittable capacitated network design problem
• Approximation schemes for capacitated geometric network design
• Approximation schemes for capacitated geometric network design
• Approximation to the Minimum Cost Edge Installation Problem

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

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