Results 21 to 30 of about 87,603 (273)
Unified Greedy Approximability beyond Submodular Maximization
SIAM Journal on Discrete Mathematics, 2022 We consider classes of objective functions of cardinality constrained maximization problems for which the greedy algorithm guarantees a constant approximation. We propose the new class of $γ$-$α$-augmentable functions and prove that it encompasses several important subclasses, such as functions of bounded submodularity ratio, $α$-augmentable functions,
Yann Disser, David Weckbecker
openaire +3 more sources
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
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
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
Lebesgue type inequalities for quasi-greedy bases [PDF]
, 2012 We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy functions and the ...
Garrigós, Gustavo +2 more
core +2 more sources
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
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i.
Deshpande, Amol +2 more
core +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