Approximation algorithms for a capacitated network design problem

DOI10.1007/S00453-003-1069-7zbMATH Open1138.90347OpenAlexW2120679858MaRDI QIDQ1879243FDOQ1879243

Authors: Refael Hassin, R. Ravi, F. Sibel Salman 

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1069-7

Recommendations

• scientific article; zbMATH DE number 1670539
• Approximability of capacitated network design
• Approximability of capacitated network design
• Approximation Algorithms for a Network Design Problem
• Approximation algorithms for network design problems
• Approximation schemes for capacitated geometric network design
• Approximation schemes for capacitated geometric network design
• Approximation Algorithms for Network Design Problems on Bounded Subsets
• Approximation algorithms for prize-collecting capacitated network design problems
• scientific article; zbMATH DE number 1342141

zbMATH Keywords

Approximation algorithmsNetwork designCapacity installationRouting flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (35)

• Approximating the \(k\)-splittable capacitated network design problem
• Title not available (Why is that?)
• On fixed cost \(k\)-flow problems
• Automata, Languages and Programming
• A 2-approximation algorithm for the network substitution problem
• Approximation schemes for capacitated geometric network design
• Approximation schemes for capacitated geometric network design
• Approximation to the Minimum Cost Edge Installation Problem
• Improved approximation for fractionally subadditive network design
• On the approximation of the generalized capacitated tree-routing problem
• Approximating Capacitated Tree-Routings in Networks
• Approximating the \(k\)-splittable capacitated network design problem
• Algorithms and extended formulations for one and two facility network design
• Title not available (Why is that?)
• Approximation algorithms for soft-capacitated facility location in capacitated network design
• Algorithms for a network design problem with crossing supermodular demands
• Capacitated network design on undirected graphs
• A branch-and-cut algorithm for capacitated network design problems
• Complexity and Approximation of the Continuous Network Design Problem
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Solving the capacitated local access network design problem
• Network design with a discrete set of traffic matrices
• Approximating capacitated tree-routings in networks
• On the approximability of some network design problems
• Risk Based Optimization of Electronics Manufacturing Supply Chains
• Approximating some network design problems with node costs
• Algorithms for the non-bifurcated network design problem
• Title not available (Why is that?)
• Approximating the Generalized Capacitated Tree-Routing Problem
• Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
• An approximation algorithm for network design problems with downwards-monotone demand functions
• Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
• Approximation Algorithms for a Network Design Problem
• On the approximability of some network design problems
• Exact Approaches for Designing Multifacility Buy-at-Bulk Networks

This page was built for publication: Approximation algorithms for a capacitated network design problem

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