Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 7 / 7
First pagePrevious page1Next pageLast page
1.
Submodularne funkcije
Edin Husić, 2015, undergraduate thesis

Found in: ključnih besedah
Summary of found: ...binatorial optimization, submodular function, submodular function maximization, approximation algorithm, ...
Keywords: combinatorial optimization, submodular function, submodular function maximization, approximation algorithm
Published: 15.10.2015; Views: 2540; Downloads: 13
URL Full text (0,00 KB)

2.
The minimum conflict-free row split problem revisited
Alexandru I. Tomescu, Romeo Rizzi, Martin Milanič, Edin Husić, Ademir Hujdurović, 2016, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness...
Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published: 14.11.2017; Views: 776; Downloads: 181
URL Full text (0,00 KB)
This document has more files! More...

3.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, original scientific article

Found in: ključnih besedah
Summary of found: ...digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness
Published: 08.05.2018; Views: 653; Downloads: 84
URL Full text (0,00 KB)

4.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Martin Milanič, 2018, published scientific conference contribution abstract (invited lecture)

Found in: ključnih besedah
Summary of found: ...digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic...
Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 277; Downloads: 5
URL Full text (0,00 KB)

5.
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic...
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 301; Downloads: 19
.pdf Full text (1,44 MB)
This document has more files! More...

6.
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Ademir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: ...digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic...
Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic
Published: 17.09.2018; Views: 360; Downloads: 59
URL Full text (0,00 KB)

7.
Aproksimacijski vidiki vektorske dominacije in vektorske povezanosti v grah
Mirza Krbezlija, 2018, undergraduate thesis

Found in: ključnih besedah
Summary of found: ...domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programming...
Keywords: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programming
Published: 17.09.2018; Views: 344; Downloads: 11
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica