A node-based ILP formulation for the node-weighted dominating Steiner problem
نویسندگان
چکیده
منابع مشابه
A node-based ILP formulation for the node-weighted dominating Steiner problem
In this article we consider the Node-Weighted Dominating Steiner Problem. Given a graph with node weights and a set of terminal nodes, the goal is to find a connected node-induced subgraph of minimum weight, such that each terminal node is contained in or adjacent to some node in the chosen subgraph. The problem arises in applications in the design of telecommunication networks. Integer program...
متن کاملThe Node-Weighted Steiner Problem in Graphs of Restricted Node Weights
In this paper we study a variant of the Node-Weighted Steiner Tree problem in which the weights (costs) of vertices are restricted, in the sense that the ratio of the maximum node weight to the minimum node weight is bounded by a quantity α. This problem has applications in multicast routing where the cost of participating routers must be taken into consideration and the network is relatively h...
متن کاملImproved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
A greedy approximation algorithm based on \spider decompositions" was developed by Klein and Ravi for node weighted Steiner trees. This algorithm provides a worst case approximation ratio of 2 lnk, where k is the number of terminals. However, the best known lower bound on the approximation ratio is lnk, assuming that NP 6 DTIME[n ], by a reduction from set cover [9, 4]. We show that for the unw...
متن کاملImproved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems
Moss and Rabani [13] study constrained node-weighted Steiner tree problems with two independent weight values associated with each node, namely, cost and prize (or penalty). They give an O(logn)-approximation algorithm for the prize-collecting node-weighted Steiner tree problem (PCST)—where the goal is to minimize the cost of a tree plus the penalty of vertices not covered by the tree. They use...
متن کاملApproximation Algorithms for Constrained Node Weighted Steiner Tree Problems
We consider a class of optimization problems, where the input is an undirected graph with two weight functions dened for each node, namely the node's pro t and its cost. The goal is to nd a connected set of nodes of low cost and high pro t. We present approximation algorithms for three natural optimization criteria that arise in this context, all of which are NP-hard. The budget problem asks fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2016
ISSN: 0028-3045
DOI: 10.1002/net.21722