Design of trees in the hose model: the balanced case

DOI10.1016/j.orl.2005.09.005zbMath1112.90009OpenAlexW2059635852WikidataQ61609582 ScholiaQ61609582MaRDI QIDQ867917

Gianpaolo Oriolo, Giuseppe F. Italiano, Stefano Leonardi

Publication date: 19 February 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.09.005

zbMATH Keywords

network designapproximation algorithmshose model

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (7)

A capacitated hub location problem under hose demand uncertainty ⋮ Design of trees in the hose model: the balanced case ⋮ Competitive and deterministic embeddings of virtual networks ⋮ An approach to robust network design in telecommunications ⋮ Network design with a discrete set of traffic matrices ⋮ A short proof of the VPN tree routing conjecture on ring networks ⋮ The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut

Cites Work

• Unnamed Item
• Routing of uncertain traffic demands
• Design of trees in the hose model: the balanced case
• Robust Convex Optimization
• Simpler and better approximation algorithms for network design
• Hardness of robust network design
• Designing Least-Cost Nonblocking Broadband Networks
• Provisioning a virtual private network
• Automata, Languages and Programming
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

This page was built for publication: Design of trees in the hose model: the balanced case