Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Sellier, François"'
Autor:
Huang, Chien-Chung, Sellier, François
Matroid intersection is a classical optimization problem where, given two matroids over the same ground set, the goal is to find the largest common independent set. In this paper, we show that there exists a certain "sparsifer": a subset of elements,
Externí odkaz:
http://arxiv.org/abs/2310.16827
Autor:
Sellier, François
In this paper, we introduce the concept of Density-Balanced Subset in a matroid, in which independent sets can be sampled so as to guarantee that (i) each element has the same probability to be sampled, and (ii) those events are negatively correlated
Externí odkaz:
http://arxiv.org/abs/2308.06520
Autor:
Huang, Chien-Chung, Sellier, François
In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid, with the obj
Externí odkaz:
http://arxiv.org/abs/2306.04342
Autor:
Huang, Chien-Chung, Sellier, François
We consider the maximum weight $b$-matching problem in the random-order semi-streaming model. Assuming all weights are small integers drawn from $[1,W]$, we present a $2 - \frac{1}{2W} + \varepsilon$ approximation algorithm, using a memory of $O(\max
Externí odkaz:
http://arxiv.org/abs/2207.03863
Autor:
Huang, Chien-Chung, Sellier, François
We consider the problem of maximizing a non-negative submodular function under the $b$-matching constraint, in the semi-streaming model. When the function is linear, monotone, and non-monotone, we obtain the approximation ratios of $2+\varepsilon$, $
Externí odkaz:
http://arxiv.org/abs/2107.13071
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Huang, Chien-Chung, Sellier, François
Publikováno v:
Algorithmica; Nov2024, Vol. 86 Issue 11, p3598-3628, 31p
Autor:
Huang, Chien-Chung, Sellier, François
Given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid, with the objective of maximizing the total weight of covered edges. This problem is a gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d36b0157b20beb38c64d3fd025251e8
Autor:
Sellier, François
Th.--Méd.--Paris 6--Broussais-Hôtel-Dieu, 1981. N°: 148.
Externí odkaz:
http://catalogue.bnf.fr/ark:/12148/cb36092130r