Výsledky vyhľadávania - Algorithm analysis and problems complexity

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

“…The ( 1 + ( λ , λ ) )  genetic algorithm proposed in Doerr et al. (Theor Comput Sci 567:87–104, 2015…”
Získať plný text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems Autor 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…”
Získať plný text

On the Parameterized Complexity of Reconfiguration Problems Autor 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…”
Získať plný text

Algorithms and Complexity on Indexing Founder Graphs Autor 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…”
Získať plný text

The Runtime of the Compact Genetic Algorithm on Jump Functions Autor Doerr, Benjamin

“…In the first and so far only mathematical runtime analysis of an estimation-of-distribution algorithm (EDA…”
Získať plný text

The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate Autor Doerr, Benjamin, Gießen, Christian, Witt, Carsten, Yang, Jing

“…We propose a new way to self-adjust the mutation rate in population-based evolutionary algorithms in discrete search spaces…”
Získať plný text

Fast Mutation in Crossover-Based Algorithms Autor 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 + ( λ , λ…”
Získať plný text

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Autor Ganian, Robert, Klute, Fabian, Ordyniak, Sebastian

“…We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD…”
Získať plný text

Finding Temporal Paths Under Waiting Time Constraints Autor Casteigts, Arnaud, Himmel, Anne-Sophie, Molter, Hendrik, Zschoche, Philipp

“…Computing a (short) path between two vertices is one of the most fundamental primitives in graph algorithmics. In recent years, the study of paths in temporal…”
Získať plný text

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization Autor 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…”
Získať plný text

Upward Book Embeddability of st-Graphs: Complexity and Algorithms Autor 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…”
Získať plný text

Exponential-Time Quantum Algorithms for Graph Coloring Problems Autor 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…”
Získať plný text

Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners Autor Yang, Yongjie

Získať plný text

Multiplicative Drift Analysis Autor Doerr, Benjamin, Johannsen, Daniel, Winzen, Carola

“…We introduce multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms…”
Získať plný text

Unique Response Roman Domination: Complexity and Algorithms Autor 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…”
Získať plný text

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity Autor 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…”
Získať plný text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems Autor 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…”
Získať plný text

Parameterized Complexity of Path Set Packing Autor Aravind, N. R., Saxena, Roopam

“… . The problem is to decide whether there exist k edge-disjoint paths in . We study the parameterized complexity of Path Set Packing with respect to both natural and structural parameters…”
Získať plný text

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem Autor Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan

“…Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular…”
Získať plný text

Correction: Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms Autor Le Gall, François

Získať plný text