Iskanje po repozitoriju

Matching, augmenting and decomposing: an overview of combinatorial methods for the independent set problem
Martin Milanič, 2010, predavanje na tuji univerzi

Objavljeno v RUP: 15.10.2013; Ogledov: 2421; Prenosov: 27
Povezava na celotno besedilo

Competitive evaluation of threshold functions and game trees in the priced information model (continuation of competitive evaluation of threshold functions)
Martin Milanič, 2009, prispevek na konferenci brez natisa

Objavljeno v RUP: 15.10.2013; Ogledov: 2305; Prenosov: 28
Povezava na celotno besedilo

Fundamentals of computation theory
2011, zbornik recenziranih znanstvenih prispevkov na mednarodni ali tuji konferenci

Objavljeno v RUP: 15.10.2013; Ogledov: 7587; Prenosov: 67
Povezava na celotno besedilo

The exact weighted independent set problem in perfect graphs and related classes
Martin Milanič, Jérôme Monnot, 2009, objavljeni znanstveni prispevek na konferenci

Opis: 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.
Ključne besede: graf, neodvisna množica, popolni graf, dvodelni graf
Objavljeno v RUP: 15.10.2013; Ogledov: 2913; Prenosov: 116
Povezava na celotno besedilo

Izdelava stimulativnega nagrajevanja v trgovskem podjetju
Davorin-Martin Sušnik, 2006, diplomsko delo

Ključne besede: motivacija, motivacijske teorije, nagrajevanje, sistem nagrajevanja, plača, plačilni sistem, trgovsko podjetje
Objavljeno v RUP: 15.10.2013; Ogledov: 3692; Prenosov: 83
Povezava na celotno besedilo
Gradivo ima več datotek! Več...