1. A complexitystudy of distance variants of covering and domination problems in H-free graphsMirza Krbezlija, 2021, master's thesis Found in: osebi
Keywords: distance-k dominating set, distance-k edge dominating set, distance-k vertex cover, distance k-edge cover, H-free graph, polynomial-time algorithm, NP-complete problem, dichotomy theorem
Published: 18.10.2021; Views: 467; Downloads: 15
 Full text (0,00 KB) |
2. |
3. |
4. Simple and fast reoptimizations for the steiner tree problemMartin Milanič, Bruno Escoffier, 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: 2388; Downloads: 24
Full text (0,00 KB) |
5. |
6. |
7. |
8. |
9. |
10. |
