相关论文: Parameterized Complexity of Satisfying Almost All …

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

In this work, we initiate a thorough study of parameterized graph optimization problems in the distributed setting. In a parameterized problem, an algorithm decides whether a solution of size bounded by a \emph{parameter} $k$ exists and if…

In this paper we consider two problems concerning string factorisation. Specifically given a string $w$ and an integer $k$ find a factorisation of $w$ where each factor has length bounded by $k$ and has the minimum (the FmD problem) or the…

We determine the power of the weighted sum scalarization with respect to the computation of approximations for general multiobjective minimization and maximization problems. Additionally, we introduce a new multi-factor notion of…

We study the problem of non-preemptively scheduling $n$ jobs, each job $j$ with a release time $t_j$, a deadline $d_j$, and a processing time $p_j$, on $m$ parallel identical machines. Cieliebak et al. (2004) considered the two constraints…

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job…

The weighted $\mathcal{T}$-free $2$-matching problem is the following problem: given an undirected graph $G$, a weight function on its edge set, and a set $\mathcal{T}$ of triangles in $G$, find a maximum weight $2$-matching containing no…

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

We consider the problem of choosing Euclidean points to maximize the sum of their weighted pairwise distances, when each point is constrained to a ball centered at the origin. We derive a dual minimization problem and show strong duality…

The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least…

In the Bin Packing problem one is given $n$ items with weights $w_1,\ldots,w_n$ and $m$ bins with capacities $c_1,\ldots,c_m$. The goal is to find a partition of the items into sets $S_1,\ldots,S_m$ such that $w(S_j) \leq c_j$ for every bin…

This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of…

In the Maximum Connectivity Improvement (MCI) problem, we are given a directed graph $G=(V,E)$ and an integer $B$ and we are asked to find $B$ new edges to be added to $G$ in order to maximize the number of connected pairs of vertices in…

Consider a linear programming problem with n primal and m dual variables paired with n dual and m primal slack variables respectively, and aggregately denote these variables and slack variables as a vector z of length 2(n+m). Unlike…