Zobrazeno 1 - 10
of 27 549
pro vyhledávání: '"Exact Algorithms"'
Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the make
Externí odkaz:
http://arxiv.org/abs/2412.08556
Autor:
Da Lozzo, Giordano, Ganian, Robert, Gupta, Siddharth, Mohar, Bojan, Ordyniak, Sebastian, Zehavi, Meirav
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an $n$-vertex planar graph whose vertices are partitioned into independent sets (called clusters) with paths - one for each cluster - that connect all the vertice
Externí odkaz:
http://arxiv.org/abs/2409.19410
Let $P$ be an orthogonal polygon of $n$ vertices, without holes. The Orthogonal Polygon Covering with Squares (OPCS) problem takes as input such an orthogonal polygon $P$ with integral vertex coordinates, and asks to find the minimum number of axis-p
Externí odkaz:
http://arxiv.org/abs/2407.02658
Autor:
Lalovic, Marko
This paper presents an $O^{*}(1.42^{n})$ time algorithm for the Maximum Cut problem on split graphs, along with a subexponential time algorithm for its decision variant.
Comment: 8 pages, 4 figures
Comment: 8 pages, 4 figures
Externí odkaz:
http://arxiv.org/abs/2405.20599
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:
Peng, Junqiang, Xiao, Mingyu ⁎
Publikováno v:
In Theoretical Computer Science 2 March 2025 1029
This paper introduces the Capacitated Covering Salesman Problem (CCSP), approaching the notion of service by coverage in capacitated vehicle routing problems. In CCSP, locations where vehicles can transit are provided, some of which have customers wi
Externí odkaz:
http://arxiv.org/abs/2403.06995
To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing better analysis methods for simple algorithms. In the mid-$2000$s, Fo
Externí odkaz:
http://arxiv.org/abs/2402.10015
In the Multiagent Path Finding problem (MAPF for short), we focus on efficiently finding non-colliding paths for a set of $k$ agents on a given graph $G$, where each agent seeks a path from its source vertex to a target. An important measure of the q
Externí odkaz:
http://arxiv.org/abs/2312.09646