R. Belmonte

activity

20102026

most citedPolynomial-time approximability of the k-Sink Location problem

6 citations · 19 across the 12 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

The Price of Connectivity for Feedback Vertex Set

Rémy Belmonte, Pim van 't Hof, Marcin Kamiński +1

Let fvs $(G)$ and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph $G$ , respectively. The price of connectivi…

cs.DS2015★ 6 cited

Polynomial-time approximability of the k-Sink Location problem

Rémy Belmonte, Yuya Higashikawa, Naoki Katoh +1

A dynamic network $N = (G, c, τ, S)$ where $G = (V, E)$ is a graph, integers $τ (e)$ and $c (e)$ represent, for each edge $e \in E$ , the time required to traverse edge $e$ and its no…