Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 9
Submodularne funkcije
Edin Husić, Martin Milanič
Diplomsko delo
Oznake: combinatorial optimization;submodular function;submodular function maximization;approximation algorithm;
Submodularne funkcije
Leto: 2015 Vir: Univerza na Primorskem (UP)
ǂA ǂpolynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
Edin Husić, Martin Milanič
Objavljeni znanstveni prispevek na konferenci
Oznake: neodvisna množica;povečujoč graf;polinomski algoritem;independent set;augmenting graph;polynomial-time algorithm;
A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
Leto: 2019 Vir: Univerza na Primorskem (UP)
ǂThe ǂmaximum independent set problem and equistable graphs
Edin Husić, Martin Milanič, Ademir Hujdurović
Magistrsko delo
Oznake: independent set;polynomial algorithm;equistable graph;
The maximum independent set problem and equistable graphs
Leto: 2017 Vir: Univerza na Primorskem (UP)
ǂThe ǂminimum conflict-free row split problem revisited
Ademir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
Objavljeni znanstveni prispevek na konferenci
Oznake: ǂthe ǂminimum conflict-free row split problem;branching;Dilworth's theorem;min-max theorem;approximation algorithm;APX-hardness;
The minimum conflict-free row split problem revisited
Leto: 2016 Vir: Univerza na Primorskem (UP)
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
Izvirni znanstveni članek
Oznake: perfect phylogeny;minimum conflict-free row split problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;APXhardness;
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Leto: 2018 Vir: Univerza na Primorskem (UP)
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
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake: popolna filogenija;NP-težek problem;vejitev;acikličen digraf;particija na verige;Dilworthov izrek;min-maks izrek;aproksimacijski algoritem;hevristika;perfect phylogeny;NP-hard problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem
Leto: 2018 Vir: Univerza na Primorskem (UP)
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
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake: perfect phylogeny;NP-hard problem;branching;acyclic digraph;chain partition;Dilworth's theorem;min-max theorem;approximation algorithm;heuristic;
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
Leto: 2017 Vir: Univerza na Primorskem (UP)
Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing
Ademir Hujdurović, Edin Husić, Xinyue Li, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
Prispevek na konferenci brez natisa
Oznake: matematika;
Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing
Leto: 2018 Vir: Univerza na Primorskem (UP)
MIPUP
Edin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu
Izvirni znanstveni članek
Oznake: perfect phylogeny;minimum conflict-free row split problem,;branching;acyclic digraph;integer linear programming;
MIPUP
Leto: 2019 Vir: Univerza na Primorskem (UP)
Št. zadetkov: 9
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: