Pages that link to "Item:Q3581584"
From MaRDI portal
The following pages link to The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema (Q3581584):
Displaying 30 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property (Q883995) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- (Q5009502) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
