Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Tokuni, Yuki"'
A dynamic flow network consists of a directed graph, where nodes called sources represent locations of evacuees, and nodes called sinks represent locations of evacuation facilities. Each source and each sink are given supply representing the number o
Externí odkaz:
http://arxiv.org/abs/2308.12651
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set $P$ of $2n$ points in the plane, and two sites $c_1$ and $c_2$, compute two $n$-stars $S_1$ and $S_2$ centered at $c_1$ and $c_2$ respecti
Externí odkaz:
http://arxiv.org/abs/2302.05937
In this paper, we propose new algorithms for evacuation problems defined on dynamic flow networks. A dynamic flow network is a directed graph in which source nodes are given supplies (i.e., the number of evacuees) and a single sink node is given a de
Externí odkaz:
http://arxiv.org/abs/2301.06857
Publikováno v:
In Theoretical Computer Science 1 December 2024 1019
This paper addresses the minmax regret 1-sink location problem on dynamic flow path networks with parametric weights. We are given a dynamic flow network consisting of an undirected path with positive edge lengths, positive edge capacities, and nonne
Externí odkaz:
http://arxiv.org/abs/2011.13569
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:
Miyadera, Ryohei, Tokuni, Yuki, Nakaya, Yushi, Fukui, Masanori, Abuku, Tomoaki, Suetsugu, Koki
The authors introduce the impartial game of the generalized Ry\=u\=o Nim, a variant of the classical game of Wythoff Nim. In the latter game, two players take turns in moving a single queen on a large chessboard, attempting to be the first to put her
Externí odkaz:
http://arxiv.org/abs/1711.01411