Solving Signal Control Problems with Second-Order Sensitivity Information of Equilibrium Network Flows by Hsun-Jung Cho, You-Heng Huang

“…Finally, this paper also demonstrates two numerical examples that show the computation of second-order sensitivity and the speed of convergence of the nonlinear approximation algorithm.…”
Get full text

On isolating points using unit disks by Matt Gibson, Gaurav Kanade, Rainer Penninger, Kasturi Varadarajan, Ivo Vigan

“…We present a $(9 + \epsilon)$-approximation algorithm for this problem and show that it is NP-complete even if all disks have unit radius and no disk contains any points. …”
Get full text

Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis by Koichi Yamazaki

“…Wu et al. (2014) showed that under the small set expansion hypothesis (SSEH) there is no polynomial time approximation algorithm with any constant approximation factor for several graph width parameters, including tree-width, path-width, and cut-width (Wu et al. 2014). …”
Get full text

An effective methodology to design scale model of non-metallic structural entity by Yuan Liming, Xie Zhijie, Dai Fei, Xu Yonggang, Zhang Yuan

“…In order to solve the problem on designing scale model of non-metallic structural entity, a method is first proposed according to the high-frequency approximation algorithm, in which reflection coefficients of designed scale model are optimized to be as identical as possible with those of theoretical scale model. …”
Get full text

Generating Efficient Outcome Points for Convex Multiobjective Programming Problems and Its Application to Convex Multiplicative Programming by Le Quang Thuy, Nguyen Thi Bach Kim, Nguyen Tuan Thien

“…As an application, we propose an outer approximation algorithm in the outcome space for solving the multiplicative convex program. …”
Get full text

Nonconcave Utility Maximisation in the MIMO Broadcast Channel by Wolfgang Utschick, Johannes Brehmer

“…Second, the monotonic structure of the rate space problem is exploited to compute a globally optimal rate vector with an outer approximation algorithm. While the second method yields the global optimum, the first method is shown to provide an attractive tradeoff between utility performance and computational complexity.…”
Get full text

Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines by Xin Xiao, Khan Muhammad Ijaz, Li Shuguang

“…For the general problem, we obtain an efficient 2-approximation algorithm. Previous work has shown that the problem cannot be approximated to within an approximation ratio better than 2, unless P = NP, even when all machines have identical speeds and capacities.…”
Get full text

An experimental analysis on the similarity of argumentation semantics by Federico Cerutti, Matthias Thimm, Mauro Vallati

“…An algorithm for grounded reasoning is thus a conceptually simple approximation algorithm that not only does not need a learning phase – like recent approaches – but also approximates well – in practice – several decision problems associated to other semantics.…”
Get full text

Reducing the rank of a matroid by Gwenaël Joret, Adrian Vetta

“…When $M$ is a graphical matroid this problem is the minimum $k$-cut problem, which admits a 2-approximation algorithm. In this paper we show that the rank reduction problem for transversal matroids is essentially at least as hard to approximate as the densest $k$-subgraph problem. …”
Get full text

A Game Theoretical Approach for Solving Winner Determination Problems by Chen-Kun Tsung, Hann-Jang Ho, Sing-Ling Lee

“…In this paper, we apply three concepts of the game theory to design an approximation algorithm: the stability of the Nash equilibrium, the self-learning of the evolutionary game, and the mistake making of the trembling hand assumption. …”
Get full text

Real-Time Resource Allocation Algorithm for the Quasi-Two-Dimensional Mobile Delay/Disrupt Tolerant Networking by Ying Wang, Yonghui Zhang

“…Therefore the information matrix of access routers and quasi-two-dimensional access bandwidth constraints were designed based on predictable environment of train mobile network, and then an approximation algorithm with O（n） algorithm complexity, based on utility differential, was proposed to meet the real-time applications. …”
Get full text

A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles by Ruimin Wang, Xiaozhuo Qi, Yuqiang Luo, Jianqiang Dong

“…Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. …”
Get full text

Feature Keypoint-Based Image Compression Technique Using a Well-Posed Nonlinear Fourth-Order PDE-Based Model by Tudor Barbu

“…It is then solved numerically by applying a consistent finite difference method-based numerical approximation algorithm that is next successfully applied in the image compression and decompression experiments, which are also discussed in this work.…”
Get full text

Inertial Subgradient Extragradient Methods for Solving Variational Inequality Problems and Fixed Point Problems by Godwin Amechi Okeke, Mujahid Abbas, Manuel de la Sen

“…These newly proposed methods are obtained by combining the viscosity approximation algorithm, the Picard Mann algorithm and the inertial subgradient extragradient method. …”
Get full text

Identifying and Querying Regularly Visited Places by Ali Gholami Rudi

“…We present an O(n log n) algorithm for trajectories in R^1 with n vertices and a (1 + \epsilon)-approximation algorithm for trajectories in R^2 to identify all such stay points. …”
Get full text

Scheduling Independent Partitions in Integrated Modular Avionics Systems. by Jinchao Chen, Chenglie Du, Pengcheng Han

“…Then with a Game Theory analogy, we design an approximation algorithm to solve the scheduling problem of partitions, by allowing each partition to optimize its own schedule according to the allocations of the others. …”
Get full text

Energy Efficient Data Collection and Directional Wireless Power Transfer in Rechargeable Sensor Networks by Zhigang Duan, Lei Tao, Xinming Zhang

“…We formulate an energy efficiency maximization optimization problem, with buffer and delay constraints and propose a (M + 1)-approximation algorithm, where M is the number of sectors that a power beacon (PB)contains. …”
Get full text

An Asymptotic Analysis of the Gradient Remediability Problem for Disturbed Distributed Linear Systems by Soraya Rekkab, Samir Benhadid, Raheam Al-Saphory

“…Finally, an approach that leads to a Mathematical approximation algorithm is explored. …”
Get full text

Simultaneously dominating all spanning trees of a graph by Sebastian Johann, Sven O. Krumke, Manuel Streicher

“…Finally, we provide a 2-approximation algorithm for finding a minimum simultaneous dominating set.…”
Get full text

Secure data offloading strategy for multi-UAV wireless networks based on minimum energy consumption by Gaofeng CUI, Yuanyuan XU, Shanghong ZHANG, Weidong WANG

“…To solve the problems of ground passive eavesdropping when ground users offload data to the multi-UAV(unmanned aerial vehicle) edge computing network, a secure data offloading strategy that minimized system energy consumption by jointly optimizing user matching and resource allocation was proposed.Considering the constraints of system delay, communication resources and computing resources, the probability of security interruption was used to restrict the security performance of the data offload process.By using block coordinate descent and successive convex approximation algorithm, the user transmission power, offload factor, UAV computing resource allocation and jamming power were jointly optimized.A pair-wise stable user matching algorithm was proposed to minimize the total energy consumption of UAV system.Simulation results demonstrate that the algorithm can realize the safe offloading of data, and has good performance in energy consumption and delay by comparing with the conventional strategies.…”
Get full text