A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
From MaRDI portal
Recommendations
Cited in
(89)- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Combinatorial optimization in system configuration design
- Approximating the weight of shallow Steiner trees
- On approximability of the independent/connected edge dominating set problems
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- Trees, paths, stars, caterpillars and spiders
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Approximating Steiner trees and forests with minimum number of Steiner points
- Generalized network design problems.
- The General Steiner Tree-Star problem.
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Spider covers and their applications
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
- Approximations for node-weighted Steiner tree in unit disk graphs
- Two-level hub Steiner trees
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- 2-node-connectivity network design
- Approximating \(k\)-connected \(m\)-dominating sets
- Approximating activation edge-cover and facility location problems
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- An approximation algorithm for vehicle routing with compatibility constraints
- Parameterized analysis of the online priority and node-weighted Steiner tree problems
- Hardness and approximation results for packing Steiner trees
- Approximation schemes for node-weighted geometric Steiner tree problems
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Bounded-hops power assignment in ad hoc wireless networks
- Approximation algorithms for priority Steiner tree problems
- Combination algorithms for Steiner tree variants
- Optimal relay node placement in delay constrained wireless sensor network design
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
- Approximating Steiner trees and forests with minimum number of Steiner points
- Trees, Paths, Stars, Caterpillars and Spiders
- Approximating Alternative Solutions
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
- Line-of-Sight Networks
- Flooding countries and destroying dams
- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
- Lower and upper bounds for the spanning tree with minimum branch vertices
- The node-weighted steiner tree problem
- Survivable network activation problems
- Competitive and deterministic embeddings of virtual networks
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs
- Improved approximation algorithms for directed Steiner forest
- Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
- Approximation algorithms for the covering Steiner problem
- Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
- Spider covering algorithms for network design problems
- scientific article; zbMATH DE number 913344 (Why is no real title available?)
- On the hardness of full Steiner tree problems
- Exact and Approximation Algorithms for the Expanding Search Problem
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- A note on iterated rounding for the survivable network design problem
- Parameterized complexity of directed Steiner tree on sparse graphs
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Approximating Steiner Networks with Node Weights
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- Approximating k-Connected m-Dominating Sets
- Approximation algorithms for replenishment problems with fixed turnover times
- Upgrading bottleneck constrained forests
- Node connectivity augmentation via iterative randomized rounding
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Minimum shared‐power edge cut
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
- 2-node-connectivity network design
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Bounded-degree spanning tree problems: models and new algorithms
- Approximating some network design problems with node costs
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Approximate Turing kernelization and lower bounds for domination problems
- Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
- A new approach for approximating directed rooted networks
- The complexity landscape of fixed-parameter directed Steiner network problems
- A logarithmic approximation algorithm for the activation edge-multicover problem
- Connected k-median with disjoint and non-disjoint clusters
- Directed buy-at-bulk spanners
- Approximating fault-tolerant group-Steiner problems
- Approximation algorithms for requirement cut on graphs
- Node-weighted Steiner tree approximation in unit disk graphs
- Sharing the cost of multicast transmissions in wireless networks
- An exact algorithm for the node weighted Steiner tree problem
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems
- Wireless network design via 3-decompositions
This page was built for publication: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840221)
