Search Results - analysis of algorithms AND problems complexity~

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

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

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

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

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension…”
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

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 on Indexing Founder Graphs by Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

“…We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH…”
Get full text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems by Le Gall, François, Seddighin, Saeed

“…) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds…”
Get full text

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints by Nip, Kameng, Wang, Zhenbo

“… We study the computational complexity and propose polynomial-time optimal or approximation algorithms…”
Get full text

On the Parameterized Complexity of Reconfiguration Problems by Mouawad, Amer E., Nishimura, Naomi, Raman, Venkatesh, Simjour, Narges, Suzuki, Akira

“…We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration variant of an optimization problem Q takes as input two feasible solutions S and T…”
Get full text

Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ,λ)) Genetic Algorithm by Doerr, Benjamin, Doerr, Carola

“…The ( 1 + ( λ , λ ) )  genetic algorithm proposed in Doerr et al. (Theor Comput Sci 567:87–104, 2015…”
Get full text

Upward Book Embeddability of st-Graphs: Complexity and Algorithms by Binucci, Carla, Da Lozzo, Giordano, Di Giacomo, Emilio, Didimo, Walter, Mchedlidze, Tamara, Patrignani, Maurizio

“… The k UBE Testing problem, which asks whether a graph admits a k UBE, was introduced in 1999 by Heath, Pemmaraju, and Trenk (SIAM J Comput 28(4), 1999…”
Get full text

Unique Response Roman Domination: Complexity and Algorithms by Banerjee, Sumanta, Chaudhary, Juhi, Pradhan, Dinabandhu

“…A function f : V ( G ) → { 0 , 1 , 2 } is called a Roman dominating function on G = ( V ( G ) , E ( G ) ) if for every vertex v with f ( v ) = 0 , there exists…”
Get full text

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization by Gomes, Guilherme C. M., Sau, Ignasi

“… The Matching Cut problem asks whether a graph has a matching cut, and has been intensively studied in the literature…”
Get full text

Fast Mutation in Crossover-Based Algorithms by Antipov, Denis, Buzdalov, Maxim, Doerr, Benjamin

“… In this first runtime analysis of a crossover-based algorithm using a heavy-tailed choice of the mutation rate, we show an even stronger impact. For the ( 1 + ( λ , λ…”
Get full text

A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems by Chen, Yu, Kuang, Kai, Yan, Xueling

“… Additionally, the complexity analysis of the proposed algorithm is investigated. To reach the point with the norm of the gradient below ɛ…”
Get full text

Exponential-Time Quantum Algorithms for Graph Coloring Problems by Shimizu, Kazuya, Mori, Ryuhei

“… of Grover’s search to branching algorithms. We also present a polynomial-space quantum algorithm not using QRAM for the graph 20-coloring problem with running time O ( 1 . 9575 n…”
Get full text

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity by Foucaud, Florent, Mertzios, George B., Naserasr, Reza, Parreau, Aline, Valicov, Petru

“…We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets…”
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

“… In the case where the function is concave, we study the computational complexity of the three problems with the goal of minimizing the makespan, the total completion time, and the total weighted…”
Get full text