Results 41 to 50 of about 2,517,848 (305)
Approximation Algorithms for Anchored Multiwatchman Routes
We study some variants of the k-Watchman Routes problem, the cooperative version of the classic Watchman Route problem in a simple polygon. The k watchmen may be required to see the whole polygon, or some pre-determined quota of area within the polygon,
Joseph S.B. Mitchell, Linh Nguyen
doaj +1 more source
Approximation Algorithms for $\ell_0$-Low Rank Approximation
We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries.
Bringmann, K. ; https://orcid.org/0000-0003-1356-5177 +2 more
openaire +4 more sources
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the ...
Guilherme Henrique Santos Miranda +3 more
doaj +1 more source
Approximate Weak Greedy Algorithms [PDF]
We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Rémi Gribonval, Morten Nielsen 0002
openaire +4 more sources
Approximation Algorithms for Scheduling with Reservations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +4 more sources
Approximate Discrete Reconstruction Algorithm [PDF]
Discrete tomography deals with tomographic reconstruction of greyscale images for which the set of possible grey levels is discrete and small. Here, we develop a discrete approximate reconstruction algorithm. Our algorithm computes an image that has only grey values belonging to a given finite set.
K.J. Batenburg (Joost) +2 more
openaire +5 more sources
The paper presents the approximation problem of the inverse kinematics algorithms for the redundant manipulators. We introduce the approximation of the dynamically consistent Jacobian by the extended Jacobian.
Ratajczak Joanna
doaj +1 more source
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph [PDF]
Article implements and tests the performances of several approximation algorithms for computing the minimum dominating set of a graph.
Potru, Rohan +5 more
core +1 more source
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems [PDF]
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing-ST). We solve the underlying LP to within a (1+ε) approximation factor in
Torres, Manuel R. +2 more
core +1 more source
Identifying Patterns of Hospitalizations Among Childhood Cancer Survivors: A Population‐Based Study
ABSTRACT Background Childhood cancer survivors (CCSs) experience more hospitalizations than the general population. We aimed to identify distinct hospitalization patterns among Queensland CCSs and the associated characteristics. Methods Cases (aged ≤14 years) diagnosed between 1995 and 2019 while residents of Queensland were identified through the ...
Hai Pham +7 more
wiley +1 more source

