Results 11 to 20 of about 87,394 (276)
A simple greedy approximation algorithm for the unit disk cover problem [PDF]
AUT Journal of Mathematics and Computing, 2020 Given a set $\mathcal P$ of $n$ points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of $\mathcal P$. We present a new $4$-approximation algorithm
Mahdi Imanparast, Seyed Naser Hashemi
doaj +1 more source
Demonstratio Mathematica, 2022 Generalized approximate weak greedy algorithms (gAWGAs) were introduced by Galatenko and Livshits as a generalization of approximate weak greedy algorithms, which, in turn, generalize weak greedy algorithm and thus pure greedy algorithm.
Valiullin Artur R. +2 more
doaj +1 more source
Simultaneous approximation by greedy algorithms [PDF]
Advances in Computational Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leviatan, D., Temlyakov, V. N.
openaire +2 more sources
Optimal Power Allocation With Multiple Joint Associations in Multi-User MIMO Full-Duplex Systems
IEEE Access, 2023 Optimum power allocation is an effective way to mitigate residual self-interference and inter-user interference in multiple input multiple output full-duplex (FD) systems.
Kunbei Pan, Bin Zhou, Zhiyong Bu
doaj +1 more source
Collapsing Superstring Conjecture [PDF]
, 2019 In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713).
Golovnev, Alexander +4 more
core +2 more sources
SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
Forum of Mathematics, Sigma, 2014 We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the weak Chebyshev greedy algorithm (WCGA), a generalization of the weak orthogonal matching pursuit to the case of a Banach space.
V. N. TEMLYAKOV
doaj +1 more source
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
IEEE Access, 2023 Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
Fast Subspace Approximation Via Greedy Least-Squares [PDF]
Constructive Approximation, 2015 In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let $P\subset \mathbbm{R}^N$ be a given set of $M$ points. The techniques developed herein find an $O(n \log M)$-dimensional subspace that is guaranteed to always contain a near-best fit $n$-dimensional hyperplane ...
Iwen, M. A., Krahmer, Felix
openaire +3 more sources
Lebesgue constants for Chebyshev thresholding greedy algorithms
Journal of Inequalities and Applications, 2018 We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n-term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then
Chunfang Shao, Peixin Ye
doaj +1 more source
Regularized Submodular Maximization With a
IEEE Access, 2023 With the development of the Internet and the emergence of various social-media platforms, designing approximation algorithms for optimization problems such as the influence maximization in social networks has received widespread attention.
Qingqin Nong, Zhijia Guo, Suning Gong
doaj +1 more source