16 citations · 38 across the 10 of their papers we have counts for
10 papers
Weighted domination models and randomized heuristics
Lukas Dijkstra, Andrei Gagarin, Vadim Zverovich
We consider the minimum weight and smallest weight minimum-size dominating set problems in vertex-weighted graphs and networks. The latter problem is a two-objective optimization p…
On General Frameworks and Threshold Functions for Multiple Domination
V. Zverovich
We consider two general frameworks for multiple domination, which are called <r,s>-domination and parametric domination. They generalise and unify {k}-domination, k-domination, tot…
Bounds and algorithms for limited packings in graphs
Andrei Gagarin, Vadim Zverovich
We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V…
The probabilistic approach to limited packings in graphs
Andrei Gagarin, Vadim Zverovich
We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex , $\left|N[v] \cap X…
The bondage number of graphs on topological surfaces and Teschner's conjecture
Andrei Gagarin, Vadim Zverovich
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bonda…
Braess' Paradox in a Generalised Traffic Network
Vadim Zverovich, Erel Avineri
The classical network configuration introduced by Braess in 1968 is of fundamental significance because Valiant and Roughgarden showed in 2006 that `the "global" behaviour of an eq…