Ključne besede: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programmingObjavljeno v RUP: 17.09.2018; Ogledov: 2110; Prenosov: 41 Povezava na celotno besedilo
Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicObjavljeno v RUP: 17.09.2018; Ogledov: 2011; Prenosov: 119 Povezava na celotno besedilo
Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicObjavljeno v RUP: 17.09.2018; Ogledov: 1936; Prenosov: 78 Celotno besedilo (1,44 MB)Gradivo ima več datotek! Več...
Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristicObjavljeno v RUP: 17.09.2018; Ogledov: 1932; Prenosov: 20 Povezava na celotno besedilo