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 - 5 / 5
First pagePrevious page1Next pageLast page
1.
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: ...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: 256; Downloads: 5
URL Full text (0,00 KB)

2.
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: ...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: 284; Downloads: 19
.pdf Full text (1,44 MB)
This document has more files! More...

3.
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: ...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: 340; Downloads: 56
URL Full text (0,00 KB)

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

Found in: ključnih besedah
Summary of found: ...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: 330; Downloads: 11
URL Full text (0,00 KB)

5.
A two-stage heuristic for the university course timetabling problem
Balázs Dávid, Máté Pintér, 2019, published scientific conference contribution

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: university course timetabling, local search, heuristic
Published: 14.11.2019; Views: 112; Downloads: 24
URL Full text (0,00 KB)
This document has more files! More...

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