activity
20152025
most citedThe complexity of dominating set reconfiguration

4 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Approximation Algorithms for Flexible Graph Connectivity

Sylvia Boyd, Joseph Cheriyan, Arash Haddadan +1

We present approximation algorithms for several network design problems in the model of Flexible Graph Connectivity (Adjiashvili, Hommelsheim and Mühlenthaler, "Flexible Graph Conn…

cs.DS2021

A -Approximation Algorithm for Flexible Graph Connectivity

Sylvia Boyd, Joseph Cheriyan, Arash Haddadan +1

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