Search Results - "Algorithm Analysis and Problem Complexity"

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

A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation by Yuan, Haitao, Li, Guoliang

“…Intelligent transportation (e.g., intelligent traffic light) makes our travel more convenient and efficient. With the development of mobile Internet and…”
Get full text

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

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 ) is one of the few examples for which a super-constant…”
Get full text

Temporal Network Optimization Subject to Connectivity Constraints by Mertzios, George B., Michail, Othon, Spirakis, Paul G.

“…In this work we consider temporal networks , i.e. networks defined by a labeling λ assigning to each edge of an underlying graph G a set of discrete…”
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) on a multimodal problem, Hasenöhrl and Sutton…”
Get full text

Twin-width and Polynomial Kernels by Bonnet, Édouard, Kim, Eun Jung, Reinald, Amadeus, Thomassé, Stéphan, Watrigant, Rémi

“…We study the existence of polynomial kernels, for parameterized problems without a polynomial kernel on general graphs, when restricted to graphs of bounded…”
Get full text

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

Get full text

DB-GPT: Large Language Model Meets Database by Zhou, Xuanhe, Sun, Zhaoyan, Li, Guoliang

“…Large language models (LLMs) have shown superior performance in various areas. And LLMs have the potential to revolutionize data management by serving as the…”
Get full text

Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions by Jaiswal, Ragesh, Kumar, Amit

“…Constrained clustering problems generalize classical clustering formulations, e.g., k -median , k -means , by imposing additional constraints on the…”
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), where the aim is to find a maximum induced subgraph whose maximum…”
Get full text

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

“…The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017), called fast mutation to agree with the previously used language, so far was proven to…”
Get full text

Correction: Galloping in Fast-Growth Natural Merge Sorts by Ghasemi, Elahe, Jugé, Vincent, Khalighinejad, Ghazal, Yazdanyar, Helia

Get full text

Representation Learning in Multi-view Clustering: A Literature Review by Chen, Man-Sheng, Lin, Jia-Qi, Li, Xiang-Long, Liu, Bao-Yu, Wang, Chang-Dong, Huang, Dong, Lai, Jian-Huang

“…Multi-view clustering (MVC) has attracted more and more attention in the recent few years by making full use of complementary and consensus information between…”
Get full text

Dynamic and Internal Longest Common Substring by Amir, Amihood, Charalampopoulos, Panagiotis, Pissis, Solon P., Radoszewski, Jakub

“…Given two strings S and T , each of length at most n , the longest common substring (LCS) problem is to find a longest substring common to S and T . This is a…”
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. Our…”
Get full text

Image Preprocessing in Classification and Identification of Diabetic Eye Diseases by Sarki, Rubina, Ahmed, Khandakar, Wang, Hua, Zhang, Yanchun, Ma, Jiangang, Wang, Kate

“…Diabetic eye disease (DED) is a cluster of eye problem that affects diabetic patients. Identifying DED is a crucial activity in retinal fundus images because…”
Get full text

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers by Akitaya, Hugo A., Arkin, Esther M., Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Korman, Matias, Palop, Belen, Parada, Irene, Renssen, André van, Sacristán, Vera

“…We present the first universal reconfiguration algorithm for transforming a modular robot between any two facet-connected square-grid configurations using…”
Get full text

Edge Exploration of Temporal Graphs by Bumpus, Benjamin Merlin, Meeks, Kitty

“…We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the static case, it is NP -hard to determine whether a given…”
Get full text

Compact Distributed Certification of Planar Graphs by Feuilloley, Laurent, Fraigniaud, Pierre, Montealegre, Pedro, Rapaport, Ivan, Rémila, Éric, Todinca, Ioan

“…Naor M., Parter M., Yogev E.: (The power of distributed verifiers in interactive proofs. In: 31st ACM-SIAM symposium on discrete algorithms (SODA), pp…”
Get full text