Results 271 to 280 of about 8,591 (298)
Some of the next articles are maybe not open access.

Greedy Approximation Algorithms

2013
Greedy strategy is a simple and natural method in the design of approximation algorithms. This chapter presents greedy approximation algorithms for very broad classes of maximization problems and minimization problems and analyzes their approximation bounds.
openaire   +1 more source

Minimum bases for permutation groups: The greedy approximation

Journal of Algorithms, 1992
The notion of a base and a strong generating set, that was introduced by C. Sims in the sixties, plays a central role in all computational methods for permutation groups. For a permutation group \(G\) acting on a set \(\Omega\) a base is a sequence \(B=(b_ 1,b_ 2,\dots,b_ k)\) of points \(b_ i\in \Omega\), such that the only element in \(G\) fixing all
openaire   +1 more source

Greedy approximation by arbitrary sets

Izvestiya: Mathematics, 2020
Abstract We define various algorithms for greedy approximations by elements of an arbitrary set in a Banach space. We study the convergence of these algorithms
openaire   +1 more source

Greedy approximation of characteristic functions

Proceedings of the Steklov Institute of Mathematics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The best m-term approximation and greedy algorithms

Advances in Computational Mathematics, 1998
The author proves two theorems on nonlinear \(m\)-term approximation in \(L_p ...
openaire   +1 more source

Tight Approximation Ratios of Two Greedy Algorithms for Optimal RSU Deployment in One-Dimensional VANETs

IEEE Transactions on Vehicular Technology, 2021
Zhenguo Gao   +2 more
exaly  

Convergence of regularized greedy approximations

Izvestiya: Mathematics
We consider a new version of a greedy algorithm in biorthogonal systems in separable Banach spaces. We consider approximations of an element $f$ via $m$-term greedy sum, which is constructed from the expansion by choosing the first $m$ greatest in absolute value coefficients.
openaire   +2 more sources

Greedy Approximation with Respect to Dictionaries

2015
In this chapter we consider greedy algorithms with respect to general systems in Banach spaces. We already pointed out in Chapter 5 that greedy algorithms designed for general systems turn out to be good for the trigonometric system.
openaire   +1 more source

A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks

Journal of Combinatorial Optimization, 2021
Lidong Wu, Ding-Zhu Du, Zhong Hao
exaly  

Greedy Approximation Algorithms

2014
Weili Wu, Feng Wang
openaire   +1 more source

Home - About - Disclaimer - Privacy