Results 1 to 10 of about 85,241 (257)
Recommending Links to Control Elections via Social Influence
Political parties recently learned that they must use social media campaigns along with advertising on traditional media to defeat their opponents.
Federico Corò +2 more
doaj +1 more source
The purpose of this special issue of Algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuning, and experimental evaluation of ...
Mattia D’Emidio, Daniele Frigioni
doaj +1 more source
Set-Valued Approximation—Revisited and Improved
We address the problem of approximating a set-valued function F, where F:[a,b]→K(Rd) given its samples {F(a+ih)}i=0N, with h=(b−a)/N. We revisit an existing method that approximates set-valued functions by interpolating signed-distance functions.
David Levin
doaj +1 more source
Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems have appeared.
Nodari Vakhania +2 more
doaj +1 more source
Minimum 2-vertex strongly biconnected spanning directed subgraph problem [PDF]
Raed Jaberi
doaj +1 more source
Approximation Algorithms for $\ell_0$-Low Rank Approximation
We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries.
Bringmann, K. ; https://orcid.org/0000-0003-1356-5177 +2 more
openaire +3 more sources
In this paper, we present a new distributed approximation algorithm for the minimum dominating set problem in planar triangle-free graphs. The algorithm operates in a constant number of rounds in the LOCAL model.
Wojciech Wawrzyniak
doaj +1 more source
Convergence by Class of Kantorovich-Type q-Szász Operators and Comprehensive Results
In this paper, we primarily use Stancu variants of Kantorovich-type operators to investigate the convergence and other associated properties of new Szász–Mirakjan operators.
Md. Nasiruzzaman +2 more
doaj +1 more source
Efficient Adaptive Speech Reception Threshold Measurements Using Stochastic Approximation Algorithms. [PDF]
Dingemanse G, Goedegebure A.
europepmc +1 more source
The celebrated question of whether P=NP continues to define the boundary between the feasible and the intractable in computer science. In this paper, we revisit the problem from two complementary angles: Time-Relative Description Complexity and automated
John Abela +2 more
doaj +1 more source

