Results 1 to 10 of about 1,645,700 (287)
On the Rate of Convergence of Greedy Algorithms
In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions.
Vladimir Temlyakov
doaj +6 more sources
A Comparison of Greedy Algorithm and Dynamic Programming Algorithm [PDF]
Two algorithms to handle the problem include greedy algorithms and dynamic programming. Because of their simplicity, intuitiveness, and great efficiency in addressing problems, they are frequently employed in a variety of circumstances.
Chen Xiaoxi
doaj +1 more source
Improving Greedy Spanner Construction Algorithm [PDF]
In recent years, several algorithms with different time complexities have been proposed for the construction of greedy spanners. However, a not so apparently suitable algorithm with running time complexity , namely the FG algorithm, is proved to be ...
hosein salami, Mostafa Nouri Baygi
doaj +1 more source
A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem
This study describes a novel greedy algorithm for optimizing the well-known Curriculum-Based Course Timetabling (CB-CTT) problem. Greedy algorithms are a good alternative to brute-force and evolutionary algorithms, which take a long time to execute in ...
Batuhan Mustafa Coşar +2 more
doaj +1 more source
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
Identifying cohesive subgraphs is an important topic in graph theory and complex network analysis. The quasi‐clique, as a generalization of clique, can be used to identify the functional and structural properties of various networks.
Jincheng Zhou, Shuhong Liu, Jian Gao
doaj +1 more source
Multi-greedy geographic packets forwarding using flow-based indicators [PDF]
The MANET packet routing method of geographic greedy forwarding involves the selection of distance reducing intermediate relays towards a destination.
G. Oladeji-Atanda, D. Mpoeleng, F. Ogwu
doaj +1 more source
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid ...
Jonathan Li +2 more
doaj +1 more source
Conjugate Gradient Iterative Hard Thresholding for Structured Sparsity
Greedy sparse recovery algorithms are studied in the structured sparsity (sparsity in levels) framework. Recovery guarantees are provided for Normalized Iterative Hard Thresholding and Conjugate Gradient Iterative Hard Thresholding in the form of ...
Jeffrey D. Blanchard
doaj +1 more source
Survey of 8 UAV Set-Covering Algorithms for Terrain Photogrammetry
Remote sensing with unmanned aerial vehicles (UAVs) facilitates photogrammetry for environmental and infrastructural monitoring. Models are created with less computational cost by reducing the number of photos required.
Joshua E. Hammond +8 more
doaj +1 more source
Greedy Algorithms for Optimal Distribution Approximation
The approximation of a discrete probability distribution t by an M-type distribution p is considered. The approximation error is measured by the informational divergence D ( t ∥ p ) , which is an appropriate measure, e.g., in the ...
Bernhard C. Geiger, Georg Böcherer
doaj +1 more source

