Browsing Theses by Subject "primal dual algorithm"
Now showing items 1-1 of 1
-
Node-Weighted Prize Collecting Steiner Tree and Applications
(University of Waterloo, 2013-05-23)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 ...