Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"node-weighted quota steiner tree"”.

  1. Node-Weighted Prize Collecting Steiner Tree and Applications

    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 graph …

    waterloo Repository record for Node-Weighted Prize Collecting Steiner Tree and Applications (opens in a new tab)