Search the repository

Matching, augmenting and decomposing: an overview of combinatorial methods for the independent set problem
Martin Milanič, 2010, invited lecture at foreign university

Published in RUP: 15.10.2013; Views: 2464; Downloads: 27
Link to full text

Competitive evaluation of threshold functions and game trees in the priced information model (continuation of competitive evaluation of threshold functions)
Martin Milanič, 2009, unpublished conference contribution

Published in RUP: 15.10.2013; Views: 2342; Downloads: 28
Link to full text

Fundamentals of computation theory
2011, proceedings of peer-reviewed scientific conference contributions (international and foreign conferences)

Published in RUP: 15.10.2013; Views: 7690; Downloads: 67
Link to full text

The exact weighted independent set problem in perfect graphs and related classes
Martin Milanič, Jérôme Monnot, 2009, published scientific conference contribution

Abstract: The exact weighted independent set (EWIS) problem consists in determining whether a given vertex-weighted graph contains an independent set of given weight. This problem is a generalization of two well-known problems, the NP-complete subset sum problem and the strongly NP-hard maximum weight independent set (MWIS) problem. Since the MWIS problem is polynomially solvable for some special graph classes, it is interesting to determine the complexity of this more general EWIS problem for such graph classes. We focus on the class of perfect graphs, which is one of the most general graph classes where the MWIS problem can be solved in polynomial time. It turns out that for certain subclasses of perfect graphs, the EWIS problem is solvable in pseudopolynomial time, while on some others it remains strongly NP-complete.In particular, we show that the EWIS problem is strongly NP-complete for bipartite graphs of maximum degree three, but solvable in pseudo-polynomial time for cographs, interval graphs and chordal graphs, as well as for some other related graph classes.
Keywords: graf, neodvisna množica, popolni graf, dvodelni graf
Published in RUP: 15.10.2013; Views: 2958; Downloads: 116
Link to full text

Izdelava stimulativnega nagrajevanja v trgovskem podjetju
Davorin-Martin Sušnik, 2006, undergraduate thesis

Keywords: motivacija, motivacijske teorije, nagrajevanje, sistem nagrajevanja, plača, plačilni sistem, trgovsko podjetje
Published in RUP: 15.10.2013; Views: 3710; Downloads: 85
Link to full text
This document has more files! More...