Search Results - algorithm analysis and problems complexity

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

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

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

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

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

“…In the first and so far only mathematical runtime analysis of an estimation-of-distribution algorithm (EDA…”
Get full text

The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate by 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…”
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

Theoretical Analysis of Git Bisect by Courtiel, Julien, Dorbec, Paul, Lecoq, Romain

“…In this paper, we consider the problem of finding a regression in a version control system (VCS), such as git…”
Get full text

Recognition Complexity of Subgraphs of -Connected Planar Cubic Graphs by Goetze, Miriam, Jungeblut, Paul, Ueckerdt, Torsten

“…We study the recognition complexity of subgraphs of k -connected planar cubic graphs…”
Get full text

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

“…We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD…”
Get full text

Finding Temporal Paths Under Waiting Time Constraints by 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…”
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

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

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

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

Get full text

Multiplicative Drift Analysis by 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…”
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

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

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

Parameterized Complexity of Path Set Packing by 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…”
Get full text