Sciweavers

Share
FOCS
2010
IEEE
8 years 23 days ago
Minimum-Cost Network Design with (Dis)economies of Scale
Given a network, a set of demands and a cost function f(
Matthew Andrews, Spyridon Antonakopoulos, Lisa Zha...
EOR
2008
100views more  EOR 2008»
8 years 1 months ago
Urban rapid transit network capacity expansion
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
Ángel Marín, Patricia Jaramillo
ASC
2004
8 years 3 months ago
Adaptive reconfiguration of data networks using genetic algorithms
Genetic algorithms are applied to an important, but little-investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network t...
David J. Montana, Talib S. Hussain
CCCG
2003
8 years 4 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
8 years 5 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ICN
2001
Springer
8 years 7 months ago
Backbone Network Design with QoS Requirements
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
Hong-Hsu Yen, Frank Yeong-Sung Lin
COCOON
2005
Springer
8 years 9 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
SAINT
2008
IEEE
8 years 9 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
8 years 10 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
9 years 24 days ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
books