arXiv Open Access 2021

A $2$-Approximation Algorithm for Flexible Graph Connectivity

Sylvia Boyd Joseph Cheriyan Arash Haddadan Sharat Ibrahimpur

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS cs.DM

Penulis (4)

Sylvia Boyd

Joseph Cheriyan

Arash Haddadan

Sharat Ibrahimpur

Format Sitasi

APA MLA BibTeX

Boyd, S., Cheriyan, J., Haddadan, A., Ibrahimpur, S. (2021). A $2$-Approximation Algorithm for Flexible Graph Connectivity. https://arxiv.org/abs/2102.03304

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓