Results 21 to 30 of about 2,913,313 (303)
Approximation algorithm for the multicovering problem [PDF]
Journal of Combinatorial Optimization, 2021 Let $\mathcal{H}=(V,\mathcal{E})$ be a hypergraph with maximum edge size $\ell$ and maximum degree $Δ$. For given numbers $b_v\in \mathbb{N}_{\geq 2}$, $v\in V$, a set multicover in $\mathcal{H}$ is a set of edges $C \subseteq \mathcal{E}$ such that every vertex $v$ in $V$ belongs to at least $b_v$ edges in $C$. Set Multicover is the problem of finding
Abbass Gorgi +3 more
openaire +3 more sources
IEEE Access, 2020 In quantum swarm intelligence algorithms, the tunneling effect of the particles is determined by the potential energy acting on the particles. The tunneling effect of the particles affects the global search ability and convergence speed of the algorithm.
Kun Cheng, Peng Wang, Zhendong Li
doaj +1 more source
Influence Maximization under Fairness Budget Distribution in Online Social Networks
Mathematics, 2022 In social influence analysis, viral marketing, and other fields, the influence maximization problem is a fundamental one with critical applications and has attracted many researchers in the last decades.
Bich-Ngan T. Nguyen +3 more
doaj +1 more source
Multiple Benefit Thresholds Problem in Online Social Networks: An Algorithmic Approach
Mathematics, 2022 An important problem in the context of viral marketing in social networks is the Influence Threshold (IT) problem, which aims at finding some users (referred to as a seed set) to begin the process of disseminating their product’s information so that the ...
Phuong N. H. Pham +3 more
doaj +1 more source
Rational approximation of discrete data with asymptomatic behaviour [PDF]
This thesis is concerned with the least-squares approximation of discrete data that appear to exhibit asymptotic behaviour. In particular, we consider using rational functions as they are able to display a number of types of asymptotic behaviour.
Cooper, Philip
core +4 more sources
Approximation Algorithm for Shortest Path in Large Social Networks
Algorithms, 2020 Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost.
Dennis Nii Ayeh Mensah +2 more
doaj +1 more source
Approximation Algorithms for Hitting Subgraphs [PDF]
, 2021 Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem is a special case of the hypergraph vertex cover problem on $k$-uniform hypergraphs, and thus admits an efficient ...
Noah Brüstle +4 more
openaire +3 more sources
Leveraging Sparse Approximation for Monaural Overlapped Speech Separation From Auditory Perspective
IEEE Access, 2023 Neuroscience suggests that the sparse behavior of a neural population underlies the mechanisms of the auditory system for monaural overlapped speech separation.
Hiroshi Sekiguchi +2 more
doaj +1 more source
Unsupervised Attribute Reduction Algorithm for Mixed Data Based on Fuzzy Optimal Approximation Set
Mathematics, 2023 Fuzzy rough set theory has been successfully applied to many attribute reduction methods, in which the lower approximation set plays a pivotal role. However, the definition of lower approximation used has ignored the information conveyed by the upper ...
Haotong Wen, Shixin Zhao, Meishe Liang
doaj +1 more source
Cost-effectiveness of algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Discrete ...
Graham Farr
doaj +1 more source