Results 41 to 50 of about 2,913,313 (303)
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth [PDF]
, 2003 In this paper we present two novel generic schemes for approximation algorithms for optimization to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k
Chlebikova, Janka +14 more
core +1 more source
Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines
Sensors, 2021 As an important application of wireless sensor networks (WSNs), deployment of mobile sensors to periodically monitor (sweep cover) a set of points of interest (PoIs) arises in various applications, such as environmental monitoring and data collection ...
Dieyan Liang, Hong Shen
doaj +1 more source
Algorithmic approaches for network design with facility location: A survey [PDF]
AUT Journal of Mathematics and Computing, 2022 We consider a family of problems that combine network design and facility location. Such problems arise in many practical applications in different fields such as telecommunications, transportation networks, logistic, and energy supply networks.
Mohsen Rezapour
doaj +1 more source
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search [PDF]
, 2013 We present an optimal, combinatorial 1−1/e approximation algorithm for monotone submodular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pál and Vondrák, 2008), our algorithm is extremely simple ...
Filmus, Yuval +3 more
core +1 more source
On Strong Convergence of Halpern’s Method for Quasi-Nonexpansive Mappings in Hilbert Spaces
Mathematical Modelling and Analysis, 2016 In this paper, we introduce a Halpern’s type method to approximate common fixed points of a nonexpansive mapping T and a strongly quasi-nonexpansive mappings S, defined in a Hilbert space, such that I − S is demiclosed at 0.
Jesus Garcia Falset +3 more
doaj +1 more source
Adaptive variational discretization approximation method for parabolic optimal control problems
Journal of Inequalities and Applications, 2020 In this paper, we study variational discretization method for parabolic optimization problems. Firstly, we obtain some convergence and superconvergence analysis results of the approximation scheme.
Yuelong Tang, Yuchun Hua
doaj +1 more source
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Rémi Gribonval, Morten Nielsen 0002
openaire +4 more sources
Approximation Algorithms for $\ell_0$-Low Rank Approximation
CoRR, 2017 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 +4 more sources
Approximate Discrete Reconstruction Algorithm [PDF]
Fundamenta Informaticae, 2013 Discrete tomography deals with tomographic reconstruction of greyscale images for which the set of possible grey levels is discrete and small. Here, we develop a discrete approximate reconstruction algorithm. Our algorithm computes an image that has only grey values belonging to a given finite set.
K.J. Batenburg (Joost) +2 more
openaire +5 more sources
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +4 more sources