Search Results - Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems

Mandatory Critical Points of 2D Uncertain Scalar Fields by Günther, David, Salmon, Joseph, Tierny, Julien

“… The characterization is based on the analysis of the support of the probability density functions (PDF) of the input data. Given two scalar fields representing reliable estimations…”
Get full text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams by Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Get full text

New Bounds on the Size of Optimal Meshes by Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Get full text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms by Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper…”
Get full text

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis by LaRusic, John, Punnen, Abraham P.

“… Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time ⌈n/2…”
Get full text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems by Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“…The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Get full text

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem by Chniter, Malak, Abid, Abir, Kallel, Ilhem, Kanoun, Slim

“…The task of assessing, grouping and arranging data into meaningful groups or clusters based on their similarities/dissimilarities measures known as cluster analysis…”
Get full text

Algorithms and complexity analyses for some combinatorial optimization problems by Zhao, Hairong

“…The main focus of this dissertation is on classical combinatorial optimization problems in two important areas…”
Get full text

Algorithms and complexity analysis for some network design problems by Nguyen, Thanh-Nhan Thi

“… on these problems, and an approximation algorithm to a new access network design problem. In particular, the three problems can briefly be described as follows…”
Get full text

Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems by Watanabe, T.

“…The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted…”
Get full text

Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems by Tadayon, Bita, Smith, J. Cole

“…In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria…”
Get full text

Complexity Analysis and Algorithm Design of Pooling Problem by Dai, Yu-Hong, Diao, Rui, Fu, Kai

“…The pooling problem, also called the blending problem, is fundamental in production planning of petroleum…”
Get full text

Complexity Analyses and Algorithms for Pickup and Delivery Problems by Berbeglia, Gerardo

“…Pickup and Delivery Problems (PDPs) are a relevant class of vehicle routing problems in which objects or people need to be collected and distributed…”
Get full text

Complexity analysis and algorithms for the Program Download Problem by Peng, Chao, Zhou, Jie, Zhu, Binhai, Zhu, Hong

“…In this paper, we consider the Program Download Problem (PDP) which is to download a set of desired programs from multiple channels…”
Get full text

On convergence and complexity analysis of an accelerated forward–backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification by Sarnmeta, Panitarn, Inthakon, Warunun, Chumpungam, Dawan, Suantai, Suthep

“…In this work, we introduce a new accelerated algorithm using a linesearch technique for solving convex minimization problems in the form of a summation of two lower semicontinuous convex functions…”
Get full text

Improved grid map layout by point set matching by Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Get full text

Complexity analysis and algorithms for the Inter Cell Interference Coordination with fixed transmit powers problem by Nambiar, Ashwathi, Kasbekar, Gaurav S.

“…We study the Inter Cell Interference Coordination problem in a multi-cell OFDMA based cellular network employing universal frequency reuse…”
Get full text

Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities by Liu, Peihai, Gu, Manzhan, Lu, Xiwen

“… completion time, respectively. In addition, we propose a 2-approximation algorithm for the first problem…”
Get full text

The U-curve optimization problem: improvements on the original algorithm and time complexity analysis by Reis, Marcelo S, Ferreira, Carlos E, Barrera, Junior

“… Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem…”
Get full text

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems by Achache, Mohamed

“…In this paper we deal with the study of the polynomial complexity and numerical implementation for a short-step primal-dual interior point algorithm for monotone linear complementarity problems LCP…”
Get full text