Node-Weighted Prize Collecting Steiner Tree and Applications

Node-Weighted Prize Collecting Steiner Tree and Applications

Show other versions (1)

The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize Collecting Steiner Tree problem. In this problem, we are given a simple gr...

Full description

Bibliographic Details
Main Author: Sadeghian Sadeghabad, Sina
Language:en
Published: 2013
Subjects:
node-weighted prize collecting Steiner tree
approximation algorithm
network design
node-weighted quota steiner tree
technology diffusion
primal dual algorithm
Combinatorics and Optimization
Online Access:http://hdl.handle.net/10012/7557

Internet

http://hdl.handle.net/10012/7557

Similar Items