Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Naves, Guyslain"'
We introduce splitter networks, which abstract the behavior of conveyor belts found in the video game Factorio. Based on this definition, we show how to compute the steady-state of a splitter network. Then, leveraging insights from the players commun
Externí odkaz:
http://arxiv.org/abs/2404.05472
A Robinson space is a dissimilarity space $(X,d)$ on $n$ points for which there exists a compatible order, {\it i.e.} a total order $<$ on $X$ such that $x
Externí odkaz:
http://arxiv.org/abs/2306.08800
Publikováno v:
SIAM Journal on Mathematics of Data Science Volume 5, Issue 1, March 2023 Pages: 201 - 221
Recently, Armstrong, Guzm\'an, and Sing Long (2021), presented an optimal $O(n^2)$ time algorithm for strict circular seriation (called also the recognition of strict quasi-circular Robinson spaces). In this paper, we give a very simple $O(n\log n)$
Externí odkaz:
http://arxiv.org/abs/2205.04694
A Robinson space is a dissimilarity space $(X,d)$ (i.e., a set $X$ of size $n$ and a dissimilarity $d$ on $X$) for which there exists a total order $<$ on $X$ such that $x
Externí odkaz:
http://arxiv.org/abs/2203.12386
Since 1997 there has been a steady stream of advances for the maximum disjoint paths problem. Achieving tractable results has usually required focusing on relaxations such as: (i) to allow some bounded edge congestion in solutions, (ii) to only consi
Externí odkaz:
http://arxiv.org/abs/2007.10537
Autor:
Naves, Guyslain, Shepherd, F. Bruce
Gomory-Hu (GH) Trees are a classical sparsification technique for graph connectivity. It is one of the fundamental models in combinatorial optimization which also continually finds new applications, most recently in social network analysis. For any e
Externí odkaz:
http://arxiv.org/abs/1807.07331
Autor:
Naves, Guyslain
L'étude des cycles, flots et chemins des graphes est intimement liée au développement de l'optimisation combinatoire. Dans l'introduction nous mettons en parallèle ces concepts à partir de résultats classiques, et les deux autres parties de la
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00465585
http://tel.archives-ouvertes.fr/docs/00/46/55/85/PDF/these-mars09.pdf
http://tel.archives-ouvertes.fr/docs/00/46/55/85/PDF/these-mars09.pdf
In this note we prove that for any compact subset $S$ of a Busemann surface $({\mathcal S},d)$ (in particular, for any simple polygon with geodesic metric) and any positive number $\delta$, the minimum number of closed balls of radius $\delta$ with c
Externí odkaz:
http://arxiv.org/abs/1508.00778
Autor:
Naves, Guyslain1 (AUTHOR), Shepherd, F. Bruce2 (AUTHOR) fbrucesh@cs.ubc.ca, Xia, Henry2 (AUTHOR)
Publikováno v:
Mathematical Programming. Feb2023, Vol. 197 Issue 2, p1049-1067. 19p.
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.