Approximating Rooted Steiner Network - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Approximating Rooted Steiner Network

Joseph Cheriyan
  • Fonction : Auteur
  • PersonId : 926534
Bundit Laekhanukit
  • Fonction : Auteur
  • PersonId : 926535

Résumé

The Directed Steiner Tree (DST) problem is a cornerstone problem in network design, particularly, in the design of directed networks satisfying connectivity requirements. We focus on the generalization of the problem with higher connectivity requirements. The problem with one root and two sinks is APX-hard. The problem with one root and many sinks is as hard to approximate as the directed Steiner forest problem, and the latter is well known to be as hard to approximate as the label cover problem. Utilizing previous techniques (due to others), we strengthen these results and extend them to undirected graphs. Specifically, we give an $O(k^\epsilon)$ hardness bound for the rooted $k$-connectivity problem in undirected graphs; this addresses a recent open question of Khanna.

Mots clés

Fichier principal
Vignette du fichier
bundit-august2.pdf (284.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00709994 , version 1 (19-06-2012)

Identifiants

  • HAL Id : hal-00709994 , version 1

Citer

Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta. Approximating Rooted Steiner Network. Symposium on Discrete Algorithms (SODA 2012), Jan 2012, Kyoto, Japan. ⟨hal-00709994⟩

Collections

TDS-MACS
175 Consultations
90 Téléchargements

Partager

Gmail Facebook X LinkedIn More