Results 21 to 30 of about 3,054,349 (257)
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
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
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
, 2008 In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +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
A Greedy Algorithm for Subspace Approximation Problem [PDF]
, 2018 In the subspace approximation problem, given m points in R^{n} and an integer k
Thang, Nguyen Kim
core +1 more source
Applied Sciences, 2019 The Expanded Douglas⁻Peucker (EDP) polygonal approximation algorithm and its application method for the Opposite Angle-Based Exact Cell Decomposition (OAECD) are proposed for the mobile robot path-planning problem with curvilinear obstacles.
Jin-Woo Jung +4 more
doaj +1 more source
Surrogate modeling approximation using a mixture of experts based on EM joint estimation [PDF]
, 2010 An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and smooth approximation of discontinuous functions that are to be used in structural optimization problems.
Dimitri Bettebghor +9 more
core +1 more source
NORA: An Approach for Transforming Network Management Policies into Automated Planning Problems
Sensors, 2021 Realizing autonomic management control loops is pivotal for achieving self-driving networks. Some studies have recently evidence the feasibility of using Automated Planning (AP) to carry out these loops. However, in practice, the use of AP is complicated
Angela Rodriguez-Vivas +4 more
doaj +1 more source
Clustering Affine Subspaces: Algorithms and Hardness [PDF]
, 2012 We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core +1 more source