Pages that link to "Item:Q3787806"

The following pages link to Some generalizations of the steiner problem in graphs (Q3787806):

Displaying 18 items.

• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
• Reducing the hierarchical network design problem (Q1121181) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
• The Steiner tree polytope and related polyhedra (Q1322552) (← links)
• A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
• Generalized network design problems. (Q1810478) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• A note on the generalized Steiner tree polytope (Q1962028) (← links)
• A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
• A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms (Q5202521) (← links)
• Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)