A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks

DOI10.1007/978-3-319-59776-8_22zbMath1491.92057OpenAlexW2618612478MaRDI QIDQ2011601

Ivo Kwee, Francesco Bertoni, Murodzhon Akhmedov, Ernest Fraenkel, Alexander LeNail, Roberto Montemanni

Publication date: 4 August 2017

Full work available at URL: http://hdl.handle.net/1721.1/118381

zbMATH Keywords

biological networksprize-collecting Steiner forest

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Systems biology, networks (92C42)

Uses Software

• STRING

Cites Work

• Unnamed Item
• A note on the prize collecting traveling salesman problem
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
• Facets of two Steiner arborescence polyhedra
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Algorithmic expedients for the prize collecting Steiner tree problem
• Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
• 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
• Some generalizations of the steiner problem in graphs
• An SST-based algorithm for the steiner problem in graphs
• A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics
• Variations of the prize‐collecting Steiner tree problem

This page was built for publication: A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks