AI Chat AI Image Generator AI Video Text to Speech

A 2-Approximation Algorithm for Flexible Graph Connectivity

02/05/2021

∙

by Sylvia Boyd, et al.

∙

∙

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.

Sylvia Boyd
2 publications
Joseph Cheriyan
7 publications
Arash Haddadan
7 publications
Sharat Ibrahimpur
10 publications

page 1

page 2

research

∙ 02/27/2022

Approximation Algorithms for Flexible Graph Connectivity

We present approximation algorithms for several network design problems ...

0 Sylvia Boyd, et al. ∙

research

∙ 08/30/2023

A constant factor approximation for the (p,3)-flexible graph connectivity problem

In this article we provide a constant factor approximation for the (p,3)...

0 Ishan Bansal, et al. ∙

research

∙ 07/24/2019

Reducing Path TSP to TSP

We present a black-box reduction from the path version of the Traveling ...

0 Vera Traub, et al. ∙

research

∙ 11/07/2018

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm

Bribery in election (or computational social choice in general) is an im...

0 Lin Chen, et al. ∙

research

∙ 02/21/2018

Approximation Algorithms for Cascading Prediction Models

We present an approximation algorithm that takes a pool of pre-trained m...

0 Matthew Streeter, et al. ∙

research

∙ 04/28/2022

Survivable Network Design Revisited: Group-Connectivity

In the classical survivable network design problem (SNDP), we are given ...

0 Qingyun Chen, et al. ∙

research

∙ 12/02/2019

An improved approximation algorithm for ATSP

We revisit the constant-factor approximation algorithm for the asymmetri...

0 Vera Traub, et al. ∙