Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 10 / 86
First pagePrevious page123456789Next pageLast page
1.
Graphs of small separability
Martin Milanič, 2010, invited lecture at foreign university

Found in: osebi
Published: 15.10.2013; Views: 1010; Downloads: 11
URL Full text (0,00 KB)

2.
On hereditary efficiently dominatable graphs
Martin Milanič, 2011, unpublished conference contribution

Found in: osebi
Keywords: perfect code, efficient domination, efficiently dominatable graph, polynomial time algorithm
Published: 15.10.2013; Views: 1366; Downloads: 36
URL Full text (0,00 KB)

3.
Simple and fast reoptimizations for the steiner tree problem
Bruno Escoffier, Martin Milanič, Vangelis Th. Paschos, 2009, original scientific article

Abstract: We address reoptimization issues for the Steiner tree problem. We assume that an optimal solution is given for some instance of the problem and the objective is to maintain a good solution when the instance is subject to minor modifications, the simplest such modifications being vertex insertions and deletions. We propose fast reoptimization strategies for the case of vertex insertions and we show that maintenance of a good solution for the 'shrunk' instance, without ex nihilo computation, is impossible when vertex deletions occur. We also provide lower bounds for the approximation ratios of the reoptimization strategies studied.
Found in: osebi
Keywords: reoptimizacija, Steinerjevo drevo, aproksimacijski algoritem
Published: 15.10.2013; Views: 1272; Downloads: 10
URL Full text (0,00 KB)

4.
Competitive evaluation of threshold functions and game trees in the priced information model
Martin Milanič, 2009, unpublished conference contribution

Found in: osebi
Published: 15.10.2013; Views: 1165; Downloads: 10
URL Full text (0,00 KB)

5.
Maximum (weight) stable sets are sometimes easy to find
Martin Milanič, 2005, invited lecture at foreign university

Found in: osebi
Published: 15.10.2013; Views: 1133; Downloads: 12
URL Full text (0,00 KB)

6.
On the recognition of k-equistable graphs
Vadim E. Levit, Martin Milanič, D. Tankus, 2012, published scientific conference contribution

Found in: osebi
Keywords: maximal stable set, equistable graph, polynomial time algorithm
Published: 15.10.2013; Views: 1193; Downloads: 57
URL Full text (0,00 KB)

7.
From DNA sequencing to exact weighted independent sets
Martin Milanič, 2007, unpublished conference contribution

Found in: osebi
Published: 15.10.2013; Views: 1179; Downloads: 11
URL Full text (0,00 KB)

8.
Evaluating monotone Boolean functions and game trees in the priced information model
Martin Milanič, 2008, unpublished conference contribution

Found in: osebi
Published: 15.10.2013; Views: 1198; Downloads: 21
URL Full text (0,00 KB)
This document has more files! More...

9.
Evaluating monotone Boolean functions with priced variables
Martin Milanič, 2008, unpublished conference contribution

Found in: osebi
Published: 15.10.2013; Views: 1112; Downloads: 11
URL Full text (0,00 KB)

10.
Equistable graphs: conjectures, results, and connections with Boolean functions
Martin Milanič, Vadim E. Levit, Štefko Miklavič, James B. Orlin, Gábor Rudolf, D. Tankus, 2013, published scientific conference contribution abstract

Found in: osebi
Keywords: Boolean functions
Published: 15.10.2013; Views: 1726; Downloads: 13
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica