Ključne besede: graph, vector domination, vector connectivity, submodular set covering problem, approximation algorithm, greedy heuristic, integer linear programmingObjavljeno v RUP: 17.09.2018; Ogledov: 2108; Prenosov: 41 Povezava na celotno besedilo