Results 21 to 30 of about 1,005,063 (328)
Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs [PDF]
, 2016 We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST.
Byrka, Jarosław +2 more
core +2 more sources
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
A Primal–Dual-Based Power Control Approach for Capacitated Edge Servers
Sensors, 2022 The intensity of radio waves decays rapidly with increasing propagation distance, and an edge server’s antenna needs more power to form a larger signal coverage area.
Qinghui Zhang +3 more
doaj +1 more source
An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty
Computation, 2022 In this paper, we consider the minimum power cover problem with submodular penalty (SPMPC). Given a set U of n users, a set S of m sensors and a penalty function π:2U→R+ on the plane, the relationship that adjusts the power p(s) of each sensor s and its ...
Han Dai
doaj +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
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
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