activity
20122018
most citedFormulations for designing robust networks. An application to wind power collection

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

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DM2012

A polynomial-time algorithm for planar multicuts with few source-sink pairs

Cédric Bentz

Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges w…