Results 1 to 10 of about 7,400,368 (352)
Algorithmica, 2018 This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing the future, and ...
A Borodin +24 more
core +9 more sources
The Constant Inapproximability of the Parameterized Dominating Set Problem [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2015 We prove that there is no fpt-algorithm that can approximate the dominating set problem with any constant ratio, unless FPT= W[1]. Our hardness reduction is built on the second author's recent W[1]-hardness proof of the biclique problem.
Chen, Yijia, Lin, Bingkai
core +5 more sources
Operations Research Letters, 2004 In this paper we study cooperative cost games arising from domination problems on graphs.We introduce three games to model the cost allocation problem and we derive a necessary and su cient condition for the balancedness of all three games.Furthermore we
Velzen, S. van
core +7 more sources
On minimum intersections of certain secondary dominating sets in graphs [PDF]
Opuscula Mathematica, 2023 In this paper we consider secondary dominating sets, also named as \((1,k)\)-dominating sets, introduced by Hedetniemi et al. in 2008. In particular, we study intersections of the \((1,1)\)-dominating sets and proper \((1,2)\)-dominating sets.
Anna Kosiorowska +2 more
doaj +2 more sources
Distributed Dominating Sets on Grids [PDF]
2013 American Control Conference, 2013 This paper presents a distributed algorithm for finding near optimal dominating sets on grids. The basis for this algorithm is an existing centralized algorithm that constructs dominating sets on grids.
Fata, Elaheh +2 more
core +3 more sources
Reconfiguration of Dominating Sets [PDF]
Journal of Combinatorial Optimization, 2014 12 pages, 4 ...
Akira Suzuki +2 more
openalex +5 more sources
Distributed Dominating Set Approximations beyond Planar Graphs [PDF]
ACM Trans. Algorithms, 2019 The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there ...
Amiri, Saeed Akhoondian +2 more
core +2 more sources
Node Deployment Algorithm for Underwater Sensor Networks Based on Connected Dominating Set. [PDF]
Sensors (Basel), 2016 Existing node deployment algorithms for underwater sensor networks are nearly unable to improve the network coverage rate under the premise of ensuring the full network connectivity and do not optimize the communication and move energy consumption during
Jiang P, Liu J, Wu F, Wang J, Xue A.
europepmc +2 more sources
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining [PDF]
Information Sciences, 2017 Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs ...
Chalupa, David
core +2 more sources
DEADS: Depth and Energy Aware Dominating Set Based Algorithm for Cooperative Routing along with Sink Mobility in Underwater WSNs. [PDF]
Sensors (Basel), 2015 Performance enhancement of Underwater Wireless Sensor Networks (UWSNs) in terms of throughput maximization, energy conservation and Bit Error Rate (BER) minimization is a potential research area.
Umar A +6 more
europepmc +2 more sources