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 - 3 / 3
First pagePrevious page1Next pageLast page
1.
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
Keywords: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness
Published: 14.11.2017; Views: 788; Downloads: 185
URL Full text (0,00 KB)
This document has more files! More...

2.
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: ...perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph,...
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: 667; Downloads: 86
URL Full text (0,00 KB)

3.
MIPUP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, original scientific article

Found in: ključnih besedah
Summary of found: ...perfect phylogeny, minimum conflict-free row split problem,, branching, acyclic digraph,...
Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming
Published: 17.09.2018; Views: 389; Downloads: 56
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