Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

FOCS

2006

IEEE

2006

IEEE

Given an undirected hypergraph and a subset of vertices S ⊆ V with a speciﬁed root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to ﬁnd 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 kelement-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 gr...

Added |
11 Jun 2010 |

Updated |
11 Jun 2010 |

Type |
Conference |

Year |
2006 |

Where |
FOCS |

Authors |
Tamás Király, Lap Chi Lau |

Comments (0)