Paper Info
Title
Approximation Algorithms for Multi-budgeted Network Design Problems.
Abstract
We study the multi-budgeted version of the Survivable Network Design Problem [3] where, besides the usual connectivity requirements between pairs of points, we also need to satisfy a set of linear constraints the budgets. For this case, we provide a polynomial time 3,3 bi-criteria approximation algorithm for the problem which is based on combinatorial properties of the extreme point solutions of the natural linear relaxation of the problem.
Year
DOI
Venue
2015
10.1007/978-3-319-25258-2_10
SIROCCO
DocType
Citations 
PageRank 
Conference
1
0.36
References 
Authors
10
1
Name
Order
Citations
PageRank
Georgios Stamoulis1116.11