The node-weighted steiner tree problem
From MaRDI portal
Recommendations
- An exact algorithm for the node weighted Steiner tree problem
- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Approximation algorithms for constrained node weighted Steiner tree problems
- The multi-weighted Steiner tree problem
- A strong lower bound for the Node Weighted Steiner Tree Problem
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation schemes for node-weighted geometric Steiner tree problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- The Steiner tree problem
Cited in
(37)- An exact algorithm for the node weighted Steiner tree problem
- An SST-based algorithm for the steiner problem in graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Node-weighted Steiner tree approximation in unit disk graphs
- Node connectivity augmentation via iterative randomized rounding
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Optimal relay node placement in delay constrained wireless sensor network design
- Branch-and-price approaches for the network design problem with relays
- Arborescence polytopes for series-parallel graphs
- Strong lower bounds for the prize collecting Steiner problem in graphs
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
- Approximation algorithms for constructing Steiner trees in the Euclidean plane \(\mathbb{R}^2\) using stock pieces of materials with fixed length
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- The Steiner tree polytope and related polyhedra
- Facets of two Steiner arborescence polyhedra
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Algorithmic expedients for the prize collecting Steiner tree problem
- A node-based ILP formulation for the node-weighted dominating Steiner problem
- Combinatorial optimization in system configuration design
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Solving Steiner trees: Recent advances, challenges, and perspectives
- An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints
- Steiner trees and polyhedra
- Exact approaches for solving robust prize-collecting Steiner tree problems
- scientific article; zbMATH DE number 913344 (Why is no real title available?)
- Generalized network design problems.
- The bursty Steiner tree problem
- Approximation schemes for node-weighted geometric Steiner tree problems
- The multi-weighted Steiner tree problem: A reformulation by intersection
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
- Swap-vertex based neighborhood for Steiner tree problems
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
- On combining conventional point-to-point and automated waste collection systems
This page was built for publication: The node-weighted steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789370)
