The following pages link to (Q4537735):
Displaying 7 items.
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
