Problemi pakiranja in pokritja v grafih in hipergrafih / Packing and Covering Problems in Graphs and Hypergraphs
|
Naziv Tittle |
Problemi pakiranja in pokritja v grafih in hipergrafih / Packing and Covering Problems in Graphs and Hypergraphs |
|
Akronim Acronim |
BI-AR/15-17-009 |
|
Opis Description |
(SI) Ta projekt ima dva glavna cilja. Prvi cilj je sistematični študij zgoraj omenjenih vprašanj za iz grafov porojene hipergrafe, ki s teh vidikov še niso bili veliko študirani v literaturi. Drugi cilj je pridobiti globlji vpogled v strukturo in podobnosti problemov večkratne dominacije in omejenega pakiranja (in njunih različic) tako s teoretičnega kot s praktičnega vidika. (EN) This project has two main objectives. The first objective is to systematically study the issues mentioned above for graph-derived hypergraphs, which have not been studied much in the literature in these aspects. The second objective is to gain a deeper insight into the structure and similarities of the multiple dominance and constrained packing problems (and their variants) from both theoretical and practical perspectives. |
|
Trajanje Duration |
02/02/2015 - 31/12/2017 |
|
Vodja projekta Project Leader |
dr. Martin Milanič |
|
Sodelujoče organizacije Participating organizations |
Universidad Nacional de Rosario |
|
Oddelek Department |
Oddelek za matematiko IAM |