Robert Cummings

most citedA

4/3

-Approximation Algorithm for the Minimum

2

-Edge Connected Multisubgraph Problem in the Half-Integral Case

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

collaborators

2 papers

cs.DS2020★ 2 cited

A $4/3$ -Approximation Algorithm for the Minimum $2$ -Edge Connected Multisubgraph Problem in the Half-Integral Case

S. Boyd, J. Cheriyan, R. Cummings +4

Given a connected undirected graph $G ˉ$ on $n$ vertices, and non-negative edge costs $c$ , the 2ECM problem is that of finding a $2$ -edge~connected spanning multisubgraph of $\…

cs.CG2018

Rollercoasters and Caterpillars

Therese Biedl, Ahmad Biniaz, Robert Cummings +4

A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this seque…

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case

Rollercoasters and Caterpillars

A $4/3$ -Approximation Algorithm for the Minimum $2$ -Edge Connected Multisubgraph Problem in the Half-Integral Case