Related papers: Finding Points in General Position
Let $X$ be a smooth projective variety defined over a number field $K$. We give an upper bound for the generalized greatest common divisor of a point $x\in X$ with respect to an irreducible subvariety $Y\subseteq X$ also defined over $K$.…
We investigate rigidity-type problems on the real line and the circle in the non-generic setting. Specifically, we consider the problem of uniquely determining the positions of $n$ distinct points $V = {v_1, \ldots, v_n}$ given a set of…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
The existence and uniqueness of the common fixed point for generalized contractive mappings in order partial metric spaces is investigated. The existence of nonnegative solution of implicit nonlinear integral equations is also studied. Some…
We consider relative or subjective optimization problems where the goal function and feasible set are dependent of the current state of the system under consideration. In general, they are formulated as quasi-equilibrium problems, hence…
Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks. Examples are subset-minimal model-based diagnosis, nonmonotonic reasoning by means of circumscription, or…
We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the…
A monitoring edge-geodetic set of a graph is a subset $M$ of its vertices such that for every edge $e$ in the graph, deleting $e$ increases the distance between at least one pair of vertices in $M$. We study the following computational…
Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point…
We consider the problem of high-dimensional Gaussian graphical model selection. We identify a set of graphs for which an efficient estimation algorithm exists, and this algorithm is based on thresholding of empirical conditional…
General distribution steering is intrinsically an infinite-dimensional problem, when the continuous distributions to steer are arbitrary. We put forward a moment representation of the primal system for control in [42]. However, the system…
Coreset selection is powerful in reducing computational costs and accelerating data processing for deep learning algorithms. It strives to identify a small subset from large-scale data, so that training only on the subset practically…
We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…
We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…
In this work, we analyze an efficient sampling-based algorithm for general-purpose reachability analysis, which remains a notoriously challenging problem with applications ranging from neural network verification to safety analysis of…
$\delta$-Covering, for some covering range $\delta>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on the vertices as well as on the interior of the…