Suchergebnisse - (( algorithm analysis and problemy complexity ) OR ( algorithm analysis and problems complexity ))*

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

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

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems von 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 …”
Volltext

On the Parameterized Complexity of Reconfiguration Problems von 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 …”
Volltext

Algorithms and Complexity on Indexing Founder Graphs von 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 …”
Volltext

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

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

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

Fast Mutation in Crossover-Based Algorithms von 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 + ( λ , λ …”
Volltext

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

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

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

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization von 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 …”
Volltext

Upward Book Embeddability of st-Graphs: Complexity and Algorithms von 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 …”
Volltext

Exponential-Time Quantum Algorithms for Graph Coloring Problems von 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 …”
Volltext

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

Volltext

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

Unique Response Roman Domination: Complexity and Algorithms von 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 …”
Volltext

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity von 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 …”
Volltext

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems von 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 …”
Volltext

Parameterized Complexity of Path Set Packing von 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 …”
Volltext

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem von 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 …”
Volltext

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

Volltext