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 3 of 3 for “"directed Steiner tree"”.

  1. On the Integrality Gap of Directed Steiner Tree Problem

    In the Directed Steiner Tree problem, we are given a directed graph G = (V,E) with edge costs, a root vertex r ∈ V, and a terminal set X ⊆ V . The goal is to find the cheapest subset of edges that contains an r-t path for every terminal t ∈ X. The only known polylogarithmic approximations for …

    waterloo Repository record for On the Integrality Gap of Directed Steiner Tree Problem (opens in a new tab)

  2. New Algorithmic Solutions for Some Clustering and Network Design Problems

    … with degree constraints, including Group Steiner Tree (on Trees), Directed Steiner Tree, and Single-Commodity Buy-at-Bulk.

    buffalo Repository record for New Algorithmic Solutions for Some Clustering and Network Design Problems (opens in a new tab)