login
| EN

Klike in vpeta drevesa z omejenimi sredstvi / Cliques and Spanning Trees under Budget Constraints

Naziv

Tittle

Klike in vpeta drevesa z omejenimi sredstvi / Cliques and Spanning Trees under Budget Constraints

Akronim

Acronim

BI-AT/18-19-005

Opis

Description

(SI) Predlagani raziskovalni projekt obravnava posplošitve dveh klasičnih problemov algoritmične teorije grafov, problema maksimalne klike in problema minimalnega vpetega drevesa. Modeliranje konkretnih problemov s pomočjo grafov pogosto zahteva dodatne omejitve, ki niso neposredno povezane s strukturo grafa.
(EN) The proposed research project deals with generalizations of two classical problems of algorithmic graph theory, the maximum clique and the minimum spanning tree problems. Modeling practical problems with graphs often involves additional constraints that are not directly related to the graph structure. An important type of constraint that occurs very often in practice is the so-called budget constraint.

Trajanje

Duration

01/01/2018 - 31/12/2019

Vodja projekta

Project Leader

Martin Milanič

Sodelujoče organizacije

Participating organizations

University of Graz, Department od Statistics and Operations Research

Oddelek

Department

Oddelek za matematiko IAM
Univerza na Primorskem

Inštitut Andrej Marušič
UP IAM

Muzejski trg 2
6000 Koper
Slovenija

tel.: +386 (0)5 611 75 91
fax.: +386 (0)5 611 75 92
e-mail: info@iam.upr.si
Avtorske pravice
Izjava o dostopnosti