Pages that link to "Item:Q2921762"
From MaRDI portal
The following pages link to On the approximability of some network design problems (Q2921762):
Displaying 18 items.
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- A 2-approximation algorithm for the network substitution problem (Q2583715) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- (Q3128880) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← links)
- Hardness of robust network design (Q3593369) (← links)
- (Q3801367) (← links)
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS (Q4797035) (← links)
- The Priority k-Median Problem (Q5458823) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)