Pages that link to "Item:Q4378524"

The following pages link to A strong lower bound for the Node Weighted Steiner Tree Problem (Q4378524):

Displaying 14 items.

• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• An exact algorithm for the node weighted Steiner tree problem (Q876575) (← links)
• Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
• The multi-weighted Steiner tree problem: A reformulation by intersection (Q2483504) (← 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)
• A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
• A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs (Q3637048) (← links)
• Some generalizations of the steiner problem in graphs (Q3787806) (← links)
• The node-weighted steiner tree problem (Q3789370) (← links)
• A node‐based ILP formulation for the node‐weighted dominating Steiner problem (Q4565770) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)