An Efficient Algorithm of the Planar 3-Center Problem for a set of the convex position points
The planar 3-center problem for a set S of points given in the plane asks for three congruent circular disks with the minimum radius, whose union can cover all points of S completely.
Bian Donglai, Jiang Bo, Cao Zhiying
doaj +1 more source
An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem. [PDF]
Lu S, Mandava G, Yan G, Lu X.
europepmc +1 more source
Optimal solution to the set cover problem with a vicinity constraint for estimating genotype tissue expression profiles. [PDF]
Dong J, Brown S, Truong K.
europepmc +1 more source
In search of Schrödinger's patch: a functional approach to habitat delineation. [PDF]
Dennis M +6 more
europepmc +1 more source
The Capacity Gains of Gaussian Channels with Unstable Versus Stable Autoregressive Noise. [PDF]
Charalambous CD +3 more
europepmc +1 more source
Towards a systematic framework to assess restoration success of interventions in coral reef ecosystems. [PDF]
Croquer A +12 more
europepmc +1 more source
Counting Spinal Phylogenetic Networks. [PDF]
Francis A, Hendriksen M.
europepmc +1 more source
Different Data for Different Goals: Exploring Trade-Offs and Synergies in the Use of Spatial Data Inputs to Optimize Conservation Action in Sagebrush Ecosystems. [PDF]
Shyvers JE +11 more
europepmc +1 more source
Causal interventions in bond multi-dealer-to-client platforms. [PDF]
Marín Martínez P +2 more
europepmc +1 more source
Introducing Exogenous DNA Vectors Directly into <i>Trypoxylus dichotomus</i> Larvae Via In Vivo Electroporation. [PDF]
Morita S, Niimi T.
europepmc +1 more source

