Suchergebnisse - Optimization. G.2.1 [Combinatorics] Combinatorial Algorithms

Maximum Entropy Summary Trees von Karloff, Howard, Shirley, Kenneth E.

“… ‐programming algorithm to compute this maximum entropy summary tree …”
Volltext

A (1.4+ϵ)-approximation algorithm for the 2-Max-Duo problem von Chen, Yong, Lin, Guohui, Liu, Tian, Luo, Taibo, Su, Bing, Xu, Yao, Zhang, Peng

“… to 1.8 using the state-of-the-art approximation algorithm for the MIS problem on bounded-degree graphs …”
Volltext

Signed rearrangement distances considering repeated genes, intergenic regions, and indels von Siqueira, Gabriel, Alexandrino, Alexsandro Oliveira, Dias, Zanoni

“… Genome rearrangement distance problems allow to estimate the evolutionary distance between genomes. These problems aim to compute the minimum number of …”
Volltext