Pages that link to "Item:Q2379971"

The following pages link to Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971):

Displaying 19 items.

• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
• Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
• Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
• A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
• Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568) (← links)
• A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
• A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
• Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806) (← links)
• (Q2753742) (← links)
• Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
• On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
• Algorithms - ESA 2003 (Q5897287) (← links)
• A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
• An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees (Q6111962) (← links)