Skip to main content
Article thumbnail
Location of Repository

Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs

By Tamás Király and Lap Chi Lau

Abstract

Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, theSTEINER 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-max relations: • Given an undirected hypergraph H, if S is 2khyperedge-connected in H, then H has a Steiner rooted k-hyperarc-connected orientation. • Given an undirected graph G, if S is 2k-elementconnected in G, then G has a Steiner rooted k-element-connected orientation. Both results are tight in terms of the connectivity bounds. These also give polynomial time constant factor approximation algorithms for both problems. The proofs are based on submodular techniques, and a graph decomposition technique used in the STEINER TREE PACKING problem. Some complementary hardness results are presented at the end.

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.3500
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.