(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.