The following pages link to (Q2768267):
Displaying 5 items.
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
- On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling (Q2942241) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
