Variations of the prize‐collecting Steiner tree problem
From MaRDI portal
(Redirected from Publication:5487807)
Recommendations
- scientific article; zbMATH DE number 1445375
- Elementary approximation algorithms for prize collecting Steiner tree problems
- Algorithmic expedients for the prize collecting Steiner tree problem
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Cites work
- Approximation algorithms for constrained node weighted Steiner tree problems
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- The fractional prize-collecting Steiner tree problem on trees (extended abstract)
Cited in
(7)- A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
- Capacitated ring arborescence problems with profits
- Prize-collecting steiner network problems
- Efficient algorithms for the prize collecting Steiner tree problems with interval data
- Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap
- scientific article; zbMATH DE number 6783450 (Why is no real title available?)
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
This page was built for publication: Variations of the prize‐collecting Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487807)