Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Bentz, Cédric"'
An antimagic labelling of a graph is a bijection from the set of edges to $\{1, 2, \ldots , m\}$, such that all vertex-sums are pairwise distinct, where the vertex-sum of a vertex is the sum of labels on the edges incident to it. We say a graph is an
Externí odkaz:
http://arxiv.org/abs/2408.11931
Autor:
Silva, Isaías Faria1 (AUTHOR) isaiasfaria.mg@gmail.com, Bentz, Cédric2 (AUTHOR), Bouhtou, Mustapha1 (AUTHOR), Chardy, Matthieu1 (AUTHOR), Kedad-Sidhoum, Safia2 (AUTHOR)
Publikováno v:
Annals of Operations Research. Jan2024, Vol. 332 Issue 1-3, p949-988. 40p.
Publikováno v:
Electronic Notes in Discrete Mathematics, 2018, Inernational network optimization conference 2017., 64, pp.365-374
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 terminals and an integer k, we search for a minimum cost subset E $\subset$ E,
Externí odkaz:
http://arxiv.org/abs/1806.06704
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 cost functions on the edges, a root, a subset of nodes called termina
Externí odkaz:
http://arxiv.org/abs/1801.04696
Autor:
Bentz, Cédric
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-coloring of the vertices of a graph such that the total weight of vertic
Externí odkaz:
http://arxiv.org/abs/1709.05000
Autor:
Bentz, Cédric
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 these edges leaves no path from each source to its corresponding sink.
Externí odkaz:
http://arxiv.org/abs/1708.05903
Autor:
Bentz, Cédric, Bodic, Pierre Le
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 framework, we prove how better asymptotic worst-case running times can be a
Externí odkaz:
http://arxiv.org/abs/1607.07950
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 problem is to find a tree in G of minimum total length, rooted at r, span
Externí odkaz:
http://arxiv.org/abs/1607.07082
Publikováno v:
In Discrete Optimization November 2020 38
Autor:
Bentz, Cédric, Le Bodic, Pierre
Publikováno v:
In Theoretical Computer Science 24 February 2020 809:239-249