$A $2$-Approximation Algorithm for Flexible Graph Connectivity$

A $2$-Approximation Algorithm for Flexible Graph Connectivity

We present a $2$-approximation algorithm for the Flexible Graph Connectivity problem [AHM20] via a reduction to the minimum cost $r$-out $2$-arborescence problem.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	arXiv.org 2021-02
Hauptverfasser:	Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash, Ibrahimpur, Sharat
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Graph theory Mathematical analysis Minimum cost
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a $2$-approximation algorithm for the Flexible Graph Connectivity problem [AHM20] via a reduction to the minimum cost $r$-out $2$-arborescence problem.
ISSN:	2331-8422

Zusammenfassung:	We present a \(2\)-approximation algorithm for the Flexible Graph Connectivity problem [AHM20] via a reduction to the minimum cost \(r\)-out \(2\)-arborescence problem.
ISSN:	2331-8422

A \(2\)-Approximation Algorithm for Flexible Graph Connectivity