Results 21 to 30 of about 2,517,848 (305)
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]
We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian +3 more
core +1 more source
09511 Open Problems – Parameterized complexity and approximation algorithms [PDF]
The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern ...
Marx, Dániel +2 more
core +1 more source
Yosida Approximation Iterative Methods for Split Monotone Variational Inclusion Problems
In this paper, we present two iterative algorithms involving Yosida approximation operators for split monotone variational inclusion problems (SpMVIP).
Mohammad Dilshad +3 more
doaj +1 more source
Influence Circle Covering in Large-Scale Social Networks: A Shift Approach
Given a specific propagation speed $h$ in a social network $G(V, E)$ , an influence circle(IC) of a node $s$ in time $t$ is a node set of its influenced nodes, where the distance between $s$ and its expected influenced node $w$ is less than ...
Wangjun Ying, Jian Xu
doaj +1 more source
Algorithms For Positive Polynomial Approximation [PDF]
We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions.
Charles, Frédérique +2 more
openaire +3 more sources
Approximation Algorithms for Aligning Points [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergio Cabello, Marc J. van Kreveld
openaire +4 more sources
Coresets for the Average Case Error for Finite Query Sets
Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded.
Alaa Maalouf +3 more
doaj +1 more source
All-norm approximation algorithms [PDF]
Summary: A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different \(\ell_p\) norms. We address this problem by introducing the concept of an all-norm \(\rho\)-approximation algorithm, which supplies one ...
Yossi Azar +3 more
openaire +6 more sources
Transitivity Demolition and the Fall of Social Networks
In this paper, we study crucial elements of a complex network, namely its nodes and connections, which play a key role in maintaining the network's structure and function under unexpected structural perturbations of nodes and edges removal. Specifically,
Hung T. Nguyen +4 more
doaj +1 more source
The calculation of square roots is a frequently used operation in control systems of power electronics for different applications: motor drives, power converters, etc. At the same time, the execution of this procedure significantly loads microcontrollers
Anton Dianov +2 more
doaj +1 more source

