Approximation Algorithms for a Directed Network Design Problem

1999 ◽  
pp. 345-360 ◽  
Author(s):  
Vardges Melkonian ◽  
Éva Tardos
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Directed Network

scholarly journals Exact approaches for the directed network design problem with relays

Omega ◽  
2020 ◽  
Vol 91 ◽  
pp. 102005 ◽  
Author(s):  
Markus Leitner ◽  
Ivana Ljubić ◽  
Martin Riedler ◽  
Mario Ruthmair
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Directed Network

An iterated metaheuristic for the directed network design problem with relays

2017 ◽  
Vol 113 ◽  
pp. 35-45 ◽  
Author(s):  
Xiangyong Li ◽  
Shaochong Lin ◽  
Si Chen ◽  
Y.P. Aneja ◽  
Peng Tian ◽  
...  
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Network Design Problem ◽  
Directed Network

APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN

2011 ◽  
Vol 22 (08) ◽  
pp. 1949-1969 ◽  
Author(s):  
ARTUR CZUMAJ ◽  
JUREK CZYZOWICZ ◽  
LESZEK GĄSIENIEC ◽  
JESPER JANSSON ◽  
ANDRZEJ LINGAS ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Network Design ◽  
Polynomial Time ◽  
Design Problem ◽  
Graph Model ◽  
Network Design Problem ◽  
Approximation Schemes ◽  
Network Nodes ◽  
Time Approximation ◽  
General Graph

The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper, we consider geometric versions of the problem, where all points in a Euclidean space are candidates for network nodes, and present the first general approach for solving them. It enables us to obtain quasi-polynomial-time approximation schemes for basic variants of the buy-at-bulk geometric network design problem with polynomial total demand. Then, for instances with a single sink and low capacity links, we design fast polynomial-time, low-constant approximation algorithms.

Sign in / Sign up

Export Citation Format

Share Document