Zobrazeno 1 - 10
of 4 953
pro vyhledávání: '"Parameterized Algorithms"'
For a finite set $\mathcal{F}$ of graphs, the $\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\in\mathbb{N}$, a set $S$ of vertices in
Externí odkaz:
http://arxiv.org/abs/2409.04786
We study variants of the Optimal Refugee Resettlement problem where a set $F$ of refugee families need to be allocated to a set $L$ of possible places of resettlement in a feasible and optimal way. Feasibility issues emerge from the assumption that e
Externí odkaz:
http://arxiv.org/abs/2408.08392
Autor:
Randolph, Tim, Węgrzycki, Karol
We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new parameterization is a
Externí odkaz:
http://arxiv.org/abs/2407.18228
We study the parameterized complexity of a generalization of the coordinated motion planning problem on graphs, where the goal is to route a specified subset of a given set of $k$ robots to their destinations with the aim of minimizing the total ener
Externí odkaz:
http://arxiv.org/abs/2404.15950
Given a graph $G=(V,E)$ and an integer $k\in \mathbb{N}$, we investigate the 2-Eigenvalue Vertex Deletion (2-EVD) problem. The objective is to remove at most $k$ vertices such that the adjacency matrix of the resulting graph has at most two eigenvalu
Externí odkaz:
http://arxiv.org/abs/2404.10023
Given an ordering of the vertices of a graph, the cost of covering an edge is the smaller number of its two ends. The minimum sum vertex cover problem asks for an ordering that minimizes the total cost of covering all edges. We consider parameterized
Externí odkaz:
http://arxiv.org/abs/2403.18497
Autor:
Madathil, Jayakrishnan, Meeks, Kitty
We study {\sc Cluster Edge Modification} problems with constraints on the size of the clusters. A graph $G$ is a cluster graph if every connected component of $G$ is a clique. In a typical {\sc Cluster Edge Modification} problem such as the widely st
Externí odkaz:
http://arxiv.org/abs/2403.03830
Autor:
Aute, Shubhada, Panolan, Fahad
Minimum sum vertex cover of an $n$-vertex graph $G$ is a bijection $\phi : V(G) \to [n]$ that minimizes the cost $\sum_{\{u,v\} \in E(G)} \min \{\phi(u), \phi(v) \}$. Finding a minimum sum vertex cover of a graph (the MSVC problem) is NP-hard. MSVC i
Externí odkaz:
http://arxiv.org/abs/2401.05085
In this paper we reassess the parameterized complexity and approximability of the well-studied Steiner Forest problem in several graph classes of bounded width. The problem takes an edge-weighted graph and pairs of vertices as input, and the aim is t
Externí odkaz:
http://arxiv.org/abs/2402.09835
An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two problems related to arithmetic progressions, called Cover by Arithmetic P
Externí odkaz:
http://arxiv.org/abs/2312.06393