Results 31 to 40 of about 1,003,970 (287)
All-norm approximation algorithms [PDF]
Journal of Algorithms, 2002 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 +5 more sources
Drones Routing with Stochastic Demand
Drones, 2023 Motivated by the increasing number of drones used for package delivery, we first study the problem of Multiple drOne collaborative Routing dEsign (MORE) in this article. That is, given a fixed number of drones and customers, determining the delivery trip
Nan Yu +6 more
doaj +1 more source
Efficient Subspace Approximation Algorithms [PDF]
Discrete & Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nariankadu D. Shyamalkumar +1 more
openaire +2 more sources
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
Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
Mathematics, 2020 In this paper, we study the submodular load balancing problem with submodular penalties. The objective of this problem is to balance the load among sets, while some elements can be rejected by paying some penalties. Officially, given an element set V, we
Xiaofei Liu, Peiyin Xing, Weidong Li
doaj +1 more source
IEEE Access, 2020 Owing to the flexibility and low cost, cooperative Unmanned Aerial Vehicles(UAVs) have been attractive in multi-target positioning recently. Although it is popular and easy to accomplish, positioning based on trilateration method still faces challenges ...
Yao Ji, Chao Dong, Xiaojun Zhu, Qihui Wu
doaj +1 more source
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
, 2013 We present a near-optimal polynomial-time approximation algorithm for the asymmetric traveling salesman problem for graphs of bounded orientable or non-orientable genus.
Erickson, Jeff, Sidiropoulos, Anastasios
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
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 +3 more sources
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
, 2013 For a given graph $G$ with positive integral cost and delay on edges, distinct vertices $s$ and $t$, cost bound $C\in Z^{+}$ and delay bound $D\in Z^{+}$, the $k$ bi-constraint path ($k$BCP) problem is to compute $k$ disjoint $st$-paths subject to $C ...
C.L. Li +7 more
core +1 more source