Sylvia C. Boyd

activity

20112021

most citedA

4/3

-Approximation Algorithm for the Minimum

2

-Edge Connected Multisubgraph Problem in the Half-Integral Case

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

collaborators

Showing 2016 · cs.DMShow all

1 paper · 2 filters

cs.DM2016

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph Problem

Sylvia Boyd, Philippe Legault

Given a complete graph $K_{n} = (V, E)$ with non-negative edge costs $c \in R^{E}$ , the problem $2 E C$ is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}…