Related papers: Approximating Star Cover Problems
We present a novel method for automatically detecting and characterising semi-resolved star clusters: clusters where the observational point-spread function (PSF) is smaller than the cluster's radius, but larger than the separations between…
We present $O(\log\log n)$-round algorithms in the Massively Parallel Computation (MPC) model, with $\tilde{O}(n)$ memory per machine, that compute a maximal independent set, a $1+\epsilon$ approximation of maximum matching, and a…
We show that a $k$-fold covering using translates of an arbitrary convex polygon can be decomposed into $\Omega(k)$ covers (using an efficient algorithm). We generalize this result to obtain a constant factor approximation to the sensor…
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…
The hydrostatic equilibrium and the stability against radial perturbation of charged strange quark stars composed of a charged perfect fluid are studied. For this purpose, it is considered that the perfect fluid follows the MIT bag model…
We investigate charge accretion in vicinity of a slowly rotating compact star with a non-stationary electromagnetic field. Exact solutions to the general relativistic Maxwell equations are obtained for a star formed of a highly degenerate…
In an effort to more precisely define the spatial distribution of Galactic field stars, we present an analysis of the photometric parallaxes of 70,000 stars covering nearly 15 square degrees in seven Kapteyn Selected Areas. We address the…
Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $\Delta$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq…
The Maximal Covering Location Problem (MCLP) is a classical location problem where a company maximizes the demand covered by placing a given number of facilities, and each demand node is covered if the closest facility is within a…
We propose an ODE approach to solving multiple choice polynomial programming (MCPP) after assuming that the optimum point can be approximated by the expected value of so-called thermal equilibrium as usually did in simulated annealing. The…
In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack the bar charts (BCs) consisting of two bars into the horizontal unit-height strip of minimal length. The bars may move vertically within the strip, but it is forbidden…
The use of regional coverage satellite constellations is on the rise, urging the need for an optimal constellation design method for complex regional coverage. Traditional constellations are often designed for continuous global coverage,…
Using the L-Galaxies semi-analytic model we simultaneously fit the HI mass function, stellar mass function and galaxy colours. We find good fits to all three observations at z = 0 and to the stellar mass function and galaxy colours at z =…
Nearby dwarf irregular galaxies were searched for compact star clusters using data from the HST archives. Three of the galaxies were found to host both populous clusters (M_V<-9.5 at a fiducial age of 10 Myr) and super-star clusters…
We provide CONGEST model algorithms for approximating minimum weighted vertex cover and the maximum weighted matching. For bipartite graphs, we show that a $(1+\varepsilon)$-approximate weighted vertex cover can be computed…
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in a graph $G=(V,E)$. This is a fundamental graph problem with classical sequential algorithms that run in $\tilde{O}(n^3)$ and $\tilde{O}(mn)$ time where…
We study the maximum $k$-set coverage problem in the following distributed setting. A collection of sets $S_1,\ldots,S_m$ over a universe $[n]$ is partitioned across $p$ machines and the goal is to find $k$ sets whose union covers the most…
In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…
A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find…
We present several arguments which favor the scenario of two coexisting families of compact stars: hadronic stars and quark stars. Besides the well known hyperon puzzle of the physics of compact stars, a similar puzzle exists also when…