The following pages link to (Q2934723):
Displaying 11 items.
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← 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)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← 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)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
