Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Frei, Fabian"'
From Chinese Postman to Salesman and Beyond: Shortest Tour $\delta$-Covering All Points on All Edges
A well-studied continuous model of graphs considers each edge as a continuous unit-length interval of points. For $\delta \geq 0$, we introduce the problem $\delta$-Tour, where the objective is to find the shortest tour that comes within a distance o
Externí odkaz:
http://arxiv.org/abs/2410.10613
We study the problem \emph{Gathering} for $n$ autonomous mobile robots in synchronous settings with a persistent memory called \emph{light}. It is well known that Gathering is impossible in the basic model ($OBLOT$) where robots have no lights, even
Externí odkaz:
http://arxiv.org/abs/2408.09999
Autor:
Frei, Fabian, Gehnen, Matthias, Komm, Dennis, Královič, Rastislav, Královič, Richard, Rossmanith, Peter, Stocker, Moritz
Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which are trivially two-colorable, it is impossible to achieve anything better
Externí odkaz:
http://arxiv.org/abs/2405.18151
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work, Censor-Hillel, C
Externí odkaz:
http://arxiv.org/abs/2405.03646
Autor:
Focke, Jacob, Frei, Fabian, Li, Shaohua, Marx, Dániel, Schepper, Philipp, Sharma, Roohani, Węgrzycki, Karol
We study a general family of problems that form a common generalization of classic hitting (also referred to as covering or transversal) and packing problems. An instance of X-HitPack asks: Can removing k (deletable) vertices of a graph G prevent us
Externí odkaz:
http://arxiv.org/abs/2402.14927
Autor:
Burjons, Elisabet, Frei, Fabian, Gehnen, Matthias, Lotze, Henri, Mock, Daniel, Rossmanith, Peter
We study the Feedback Vertex Set and the Vertex Cover problem in a natural variant of the classical online model that allows for delayed decisions and reservations. Both problems can be characterized by an obstruction set of subgraphs that the online
Externí odkaz:
http://arxiv.org/abs/2307.07284
We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The goal is to visit every vertex of the graph, return to the start vertex,
Externí odkaz:
http://arxiv.org/abs/2301.13860
Autor:
Frei, Fabian, Wehner, David
In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideality. On the one hand, this notion generalizes the definition of perfec
Externí odkaz:
http://arxiv.org/abs/2301.13832
Autor:
Frei, Fabian, Rossmanith, Peter
Publikováno v:
In Theoretical Computer Science 27 November 2024 1018
We analyze the Disjoint Path Allocation problem (DPA) in the priority framework. Motivated by the problem of traffic regulation in communication networks, DPA consists of allocating edge-disjoint paths in a graph. While online algorithms for DPA have
Externí odkaz:
http://arxiv.org/abs/2202.10254