Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Kameda, Tsunehiko"'
We consider the problem of locating a set of $k$ sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first present an $O(kn\log^4n)$ time algorithm when the edge capacities are non-u
Externí odkaz:
http://arxiv.org/abs/1810.10631
Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregate evacuation time of individual evacuees. The aim of this paper is to
Externí odkaz:
http://arxiv.org/abs/1806.00814
We present a novel approach to finding the $k$-sink on dynamic path networks with general edge capacities. Our first algorithm runs in $O(n \log n + k^2 \log^4 n)$ time, where $n$ is the number of vertices on the given path, and our second algorithm
Externí odkaz:
http://arxiv.org/abs/1609.01373
We present two improved algorithms for weighted discrete $p$-center problem for tree networks with $n$ vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \log(n/p))$ time. For all values of $p$, our algorithm thus runs as fast
Externí odkaz:
http://arxiv.org/abs/1604.07535
An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We first prove an
Externí odkaz:
http://arxiv.org/abs/1512.08041
Given a set of $n$ weighted points on the $x$-$y$ plane, we want to find a step function consisting of $k$ horizontal steps such that the maximum vertical weighted distance from any point to a step is minimized. We solve this problem in $O(n)$ time w
Externí odkaz:
http://arxiv.org/abs/1512.07537
We consider the $k$-center problem in which the centers are constrained to lie on two lines. Given a set of $n$ weighted points in the plane, we want to locate up to $k$ centers on two parallel lines. We present an $O(n\log^2 n)$ time algorithm, whic
Externí odkaz:
http://arxiv.org/abs/1512.07533
This paper considers the minimax regret 1-median problem in dynamic path networks. In our model, we are given a dynamic path network consisting of an undirected path with positive edge lengths, uniform positive edge capacity, and nonnegative vertex s
Externí odkaz:
http://arxiv.org/abs/1509.07600
Publikováno v:
In Discrete Applied Mathematics 15 June 2020 280:43-52
Publikováno v:
In Theoretical Computer Science 27 June 2016 634:108-119