2017
DOI: 10.1016/j.jpdc.2016.12.001
|View full text |Cite
|
Sign up to set email alerts
|

The multi-budgeted and weighted bounded degree metric Steiner network problem

Abstract: We study the multi-budgeted version of the metric Survivable Network Design Problem (SND) [8], also known as Steiner Network problem, where besides the usual connectivity requirements (i.e., lower bound on the number edge-disjoint paths) between pre-specified pairs of points, we are also asked to satisfy a set of extra linear constraints (the budgets). Based on combinatorial properties of extreme point solutions of the natural LP relaxation of the problem and using the iterative method, we design new approxima… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?