Results 11 to 20 of about 17,784 (258)
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
Algorithms, 2020 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
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
Electronics Letters, 2023 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]
EAI Endorsed Transactions on Mobile Communications and Applications, 2021 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
Conjugate Gradient Iterative Hard Thresholding for Structured Sparsity
IEEE Open Journal of Signal Processing, 2022 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, 2020 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
A Greedy Hypercube-Labeling Algorithm [PDF]
The Computer Journal, 1992 Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms.
Bhagavathi, D. +2 more
openaire +3 more sources
Journal of ICT Research and Applications, 2014 In this paper, the problem of subcarrier allocation on chunk-by-chunk basis in SC-FDMA uplink systems is investigated. Improved mean enhanced greedy algorithms are proposed for performing joint-user and chunk-based allocation at each transmission time ...
Arfianto Fahmi +2 more
doaj +1 more source
IEEE Access, 2021 The emergence of network function virtualization (NFV) has revolutionized the infrastructure and service management of network architecture. It allows network operators to reduce costs and improve the agility of network service deployment.
Chi-Chen Yang +2 more
doaj +1 more source
Greedy Algorithms for Optimal Distribution Approximation
Entropy, 2016 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
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