The following pages link to (Q4250189):
Displaying 16 items.
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Some formulations for the group Steiner tree problem (Q2500536) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- Approximating fault-tolerant group-Steiner problems (Q2920133) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
