CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Approximate min-max theorems of Steiner rooted-orientations of hypergraphs
Authors
Tamás Király
Lap Chi Lau
Publication date
1 January 2006
Publisher
'Institute of Electrical and Electronics Engineers (IEEE)'
Doi
Cite
Abstract
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-max relations: • Given an undirected hypergraph H, if S is 2k-hyperedge-connected in H, then H has a Steiner rooted k-hyperarc-connected orientation. • Given an undirected graph G, if S is 2k-element-connected 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. © 2006 IEEE
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
ELTE Digital Institutional Repository (EDIT)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:edit.elte.hu:10831/10662
Last time updated on 11/11/2016
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 01/04/2019
Repository of the Academy's Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:real.mtak.hu:19503
Last time updated on 03/08/2016