相关论文: Wave Function Collapse Set Covering and the Hill C…
The hyperclimbing hypothesis is a hypothetical explanation for adaptation in genetic algorithms with uniform crossover (UGAs). Hyperclimbing is an intuitive, general-purpose, non-local search heuristic applicable to discrete product spaces…
Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together. Among various clustering methods, the Minimum Sum-of-Squares Clustering (MSSC) is one of the most widely used. MSSC…
Set cover and hitting set are fundamental problems in combinatorial optimization which are well-studied in the offline, online, and dynamic settings. We study the geometric versions of these problems and present new online and dynamic…
This work introduces a method to select linear functional measurements of a vector-valued time series optimized for forecasting distant time-horizons. By formulating and solving the problem of sequential linear measurement design as an…
Coverage problems are central in optimization and have a wide range of applications in data mining and machine learning. While several distributed algorithms have been developed for coverage problems, the existing methods suffer from…
Optimally selecting a subset of targets from a larger catalog is a common problem in astronomy and cosmology. A specific example is the selection of targets from an imaging survey for multi-object spectrographic follow-up. We present a new…
We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld…
We revisit a natural variant of geometric set cover, called minimum-membership geometric set cover (MMGSC). In this problem, the input consists of a set $S$ of points and a set $\mathcal{R}$ of geometric objects, and the goal is to find a…
This paper presents a robust and efficient method for tracking topological features in time-varying scalar data. Structures are tracked based on the optimal matching between persistence diagrams with respect to the Wasserstein metric. This…
Consider the following variant of the set cover problem. We are given a universe $U=\{1,...,n\}$ and a collection of subsets $\mathcal{C} = \{S_1,...,S_m\}$ where $S_i \subseteq U$. For every element $u \in U$ we need to find a set $\phi(u)…
A set cover of a hypergraph $H$ is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the position of the first vertex that hits it, and the objective is to…
This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed…
This paper deals with the coverage problem of wireless sensor network. We use the density based clustering technique - OPTICS to cover a target region with less number of sensor nodes. OPTICS works well to identify the outliers, core points…
Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and…
Direct approaches to the quantum many-body problem suffer from the so-called "curse of dimensionality": the number of parameters needed to fully specify the exact wavefunction grows exponentially with increasing system size. This motivates…
The assumption that wave function collapse is induced by correlating interactions of the kind that constitute measurements leads to a stochastic collapse equation that does not require the introduction of any new physical constants and that…
In the dynamic minimum set cover problem, a challenge is to minimize the update time while guaranteeing close to the optimal $\min(O(\log n), f)$ approximation factor. (Throughout, $m$, $n$, $f$, and $C$ are parameters denoting the maximum…
The Soft Happy Colouring (SHC) problem, a mathematical framework for identifying homophilic network structures, seeks to maximise the number of $\rho$-happy vertices, i.e. vertices with at least a proportion $\rho$ of neighbours that share…
Many meta-learning methods are proposed for few-shot detection. However, previous most methods have two main problems, poor detection APs, and strong bias because of imbalance and insufficient datasets. Previous works mainly alleviate these…
Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light of this result, it is natural to ask whether such…