Keywords: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programmingPublished in RUP: 17.09.2018; Views: 2097; Downloads: 41 Link to full text
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 2001; Downloads: 119 Link to full text
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 1924; Downloads: 78 Full text (1,44 MB)This document has more files! More...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicPublished in RUP: 17.09.2018; Views: 1910; Downloads: 20 Link to full text