Zobrazeno 1 - 10
of 195
pro vyhledávání: '"PANKRATOV, Denis"'
We study the Renting Servers in the Cloud problem (RSiC) in multiple dimensions. In this problem, a sequence of multi-parameter jobs must be scheduled on servers that can be rented on-demand. Each job has an arrival time, a finishing time, and a mult
Externí odkaz:
http://arxiv.org/abs/2404.15444
We study the truck-drone cooperative delivery problem in a setting where a single truck carrying a drone travels at constant speed on a straight-line trajectory/street. Delivery to clients located in the plane and not on the truck's trajectory is per
Externí odkaz:
http://arxiv.org/abs/2402.00829
We study temporal analogues of the Unrestricted Vertex Separator problem from the static world. An $(s,z)$-temporal separator is a set of vertices whose removal disconnects vertex $s$ from vertex $z$ for every time step in a temporal graph. The $(s,z
Externí odkaz:
http://arxiv.org/abs/2309.14185
Autor:
Li, Yaqiao, Pankratov, Denis
This paper studies the online vector bin packing (OVBP) problem and the related problem of online hypergraph coloring (OHC). Firstly, we use a double counting argument to prove an upper bound of the competitive ratio of $FirstFit$ for OVBP. Our proof
Externí odkaz:
http://arxiv.org/abs/2306.11241
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the case of $
Externí odkaz:
http://arxiv.org/abs/2207.12915
Autor:
Bondarenko, Lyubov, Baimuratova, Rose, Reindl, Marco, Zach, Verena, Dzeranov, Artur, Pankratov, Denis, Osmushko, Ivan, Kydralieva, Kamila, Dzhardimalieva, Gulzhian, Kolb, Dagmar, Prassl, Ruth, Sterrer, Martin, Schwaminger, Sebastian P.
Publikováno v:
In Materials Today Chemistry December 2024 42
Publikováno v:
In Alexandria Engineering Journal November 2024 107:215-224
Publikováno v:
In Discrete Applied Mathematics 15 February 2025 362:82-99
We study online matching in the Euclidean $2$-dimesional plane with non-crossing constraint. The offline version was introduced by Atallah in 1985 and the online version was introduced and studied more recently by Bose et al. The input to the problem
Externí odkaz:
http://arxiv.org/abs/2112.08295
Autor:
Czyzowicz, Jurek, Killick, Ryan, Kranakis, Evangelos, Krizanc, Danny, Narayanan, Lata, Opatrny, Jaroslav, Pankratov, Denis, Shende, Sunil
We consider evacuation of a group of $n \geq 2$ autonomous mobile agents (or robots) from an unknown exit on an infinite line. The agents are initially placed at the origin of the line and can move with any speed up to the maximum speed $1$ in any di
Externí odkaz:
http://arxiv.org/abs/2109.12676