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 theoremPublished in RUP: 18.10.2021; Views: 1717; Downloads: 18 Link to full text
Keywords: razvoj cepiv, kombinatorična optimizacija, celoštevilsko programiranje, hevristika "hillclimbing", problem najkrajšega skupnega nadniza, problem pokritja z množicami, vaccine design, combinatorial optimization, integer programming, hill-climbing, shortest common superstring problem, set cover problemPublished in RUP: 15.10.2015; Views: 3144; Downloads: 135 Link to full text