A permutation is happy, if it can be transformed into the identity permutation using as many short swaps as one third times the number of inversions i......
The rooted triplet distance measures the structural dissimilarity of two phylogenetic trees or phylogenetic networks by counting the number of rooted ......
期刊： ALGORITHMICA, 2021; 83 (4)
In noisy evolutionary optimization, sampling is a common strategy to deal with noise. By the sampling strategy, the fitness of a solution is evaluated......
期刊： ALGORITHMICA, 2021; 83 (4)
Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper,......
期刊： ALGORITHMICA, 2020; 82 (10)
A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T, w, d min, d max) of a tree T whose leaf set is equal to t......
期刊： ALGORITHMICA, 2020; 82 (10)
Given a simple graph G=(V,E) and a constant integer k >= 2, the k-path vertex cover problem (PkVC) asks for a minimum subset F subset of V of verti......
期刊： ALGORITHMICA, 2020; 82 (7)
The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Ka......
期刊： ALGORITHMICA, 2020; 82 (9)
Given a tree T on n vertices, and k, b, s 1,., s b. N, the Tree Partitioning problem asks if at most k edges can be removed from T so that the resulti......
期刊： ALGORITHMICA, 2020; 82 (1)
Ailon et al. (SIAM J Comput 40(2):350-375, 2011) proposed a self-improving sorter that tunes its performance to an unknown input distribution in a tra......
期刊： ALGORITHMICA, 2019; 81 (1)
The problem of pollution control has been mainly studied in the environmental economics literature where the methodology of game theory is applied for......
期刊： ALGORITHMICA, 2019; 81 (2)
Rigorous runtime analysis is a major approach towards understanding evolutionary computing techniques, and in this area linear pseudo-Boolean objectiv......
期刊： ALGORITHMICA, 2019; 81 (2)
In many real-world optimization problems, the objective function evaluation is subject to noise, and we cannot obtain the exact objective value. Evolu......
