1 citations · 2 across the 6 of their papers we have counts for
7 papers
Formulations for designing robust networks. An application to wind power collection
Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion +1
We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminal…
Robust capacitated trees and networks with uniform demands
Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion +1
We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in case of terminals with uniform demands. Formally, we are given a graph, capacity and…
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
Cédric Bentz
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-co…
An FPT algorithm for planar multicuts with sources and sinks on the outer face
Cédric Bentz
Given a list of k source-sink pairs in an edge-weighted graph G, the minimum multicut problem consists in selecting a set of edges of minimum total weight in G, such that removing…
A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem
Cédric Bentz, Pierre Le Bodic
Pruhs and Woeginger prove the existence of FPTAS's for a general class of minimization and maximization subset selection problems. Without losing generality from the original frame…
On the edge capacitated Steiner tree problem
Cedric Bentz, Marie-Christine Costa, Alain Hertz
Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree pro…