A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
From MaRDI portal
Publication:2011601
DOI10.1007/978-3-319-59776-8_22zbMATH Open1491.92057OpenAlexW2618612478MaRDI QIDQ2011601FDOQ2011601
Authors: Murodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni
Publication date: 4 August 2017
Full work available at URL: http://hdl.handle.net/1721.1/118381
Recommendations
- A comparison of heuristic methods for the prize-collecting Steiner tree problem and their application in genomics
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Algorithmic expedients for the prize collecting Steiner tree problem
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
Cites Work
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Some generalizations of the steiner problem in graphs
- A note on the prize collecting traveling salesman problem
- Title not available (Why is that?)
- Facets of two Steiner arborescence polyhedra
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- An SST-based algorithm for the steiner problem in graphs
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- Variations of the prize‐collecting Steiner tree problem
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- Algorithmic expedients for the prize collecting Steiner tree problem
- A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics
Cited In (1)
Uses Software
This page was built for publication: A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011601)