Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs

Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hyperedges so that in the resulting directed hypergraph the "connectivity" from the root r to the vertices in S is maximized. This is motivated by a multicasting problem in undirected networks as well as a generalization of some classical problems in graph theory. The main results of this paper are the following approximate min

• Type: Journal
• Year: 2008
• Where: JCT
• Authors: Tamás Király, Lap Chi Lau
• Keywords: JCT 2008, STEINER ROOTED-ORIENTATION Problem, Undirected Hypergraph, Undirected Networks