Pages that link to "Item:Q3789370"

The following pages link to The node-weighted steiner tree problem (Q3789370):

Displaying 37 items.

• Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
• Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
• An exact algorithm for the node weighted Steiner tree problem (Q876575) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• The multi-weighted Steiner tree problem (Q1179753) (← links)
• Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
• The Steiner tree polytope and related polyhedra (Q1322552) (← links)
• Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
• Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
• An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints (Q1676485) (← links)
• Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
• Generalized network design problems. (Q1810478) (← links)
• Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
• Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← 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)
• An SST-based algorithm for the steiner problem in graphs (Q3813625) (← links)
• A strong lower bound for the Node Weighted Steiner Tree Problem (Q4378524) (← links)
• A node‐based ILP formulation for the node‐weighted dominating Steiner problem (Q4565770) (← links)
• The Bursty Steiner Tree Problem (Q4639923) (← links)
• (Q4887736) (← links)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
• Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
• Steiner trees and polyhedra (Q5946818) (← links)
• Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)