Search Results - Optimization. G.2.1 [Combinatorics] Combinatorial Algorithms
-
1
Maximum Entropy Summary Trees
ISSN: 0167-7055, 1467-8659Published: Oxford, UK Blackwell Publishing Ltd 01.06.2013Published in Computer graphics forum (01.06.2013)“…‐programming algorithm to compute this maximum entropy summary tree…”
Get full text
Journal Article -
2
A (1.4+ϵ)-approximation algorithm for the 2-Max-Duo problem
ISSN: 1382-6905, 1573-2886Published: New York Springer US 01.10.2020Published in Journal of combinatorial optimization (01.10.2020)“… to 1.8 using the state-of-the-art approximation algorithm for the MIS problem on bounded-degree graphs…”
Get full text
Journal Article -
3
Signed rearrangement distances considering repeated genes, intergenic regions, and indels
ISSN: 1382-6905, 1573-2886Published: New York Springer US 01.09.2023Published in Journal of combinatorial optimization (01.09.2023)“…Genome rearrangement distance problems allow to estimate the evolutionary distance between genomes. These problems aim to compute the minimum number of…”
Get full text
Journal Article