Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
Sign Up to like & getrecommendations! Published in 2019 at "Algorithmica"
DOI: 10.1007/s00453-019-00545-0
Abstract: In this paper we consider the classical connected dominating set problem. Twenty years ago, Guha and Khuller developed two algorithms for this problem—a centralized greedy approach with an approximation guarantee of $$H(\varDelta ) +2$$H(Δ)+2, and… read more here.
Keywords: information greedy; information; local information; algorithm ... See more keywords
Critical node identification for complex network based on a novel minimum connected dominating set
Sign Up to like & getrecommendations! Published in 2017 at "Soft Computing"
DOI: 10.1007/s00500-016-2303-y
Abstract: Identifying critical nodes in complex networks aims to fragment a graph $$G = (V, E)$$G=(V,E) by removing a set of vertices R with cardinality $$\left| R \right| \le $$R≤ k, such that the residual graph… read more here.
Keywords: critical nodes; network; minimum connected; dominating set ... See more keywords
Greedy approximation for the minimum connected dominating set with labeling
Sign Up to like & getrecommendations! Published in 2021 at "Optimization Letters"
DOI: 10.1007/s11590-020-01628-6
Abstract: Given a connected graph $$G=(V,E)$$ G = ( V , E ) . A subset $$C\subseteq V$$ C ⊆ V is a dominating set if every vertex of V is either in C or adjacent… read more here.
Keywords: span; approximation; dominating set; mathrm ... See more keywords
Enhanced route discovery using connected dominating set and 2-hop repair in wireless ad hoc networks
Sign Up to like & getrecommendations! Published in 2021 at "Journal of Ambient Intelligence and Humanized Computing"
DOI: 10.1007/s12652-020-01799-1
Abstract: Efficient routing and broadcasting among a set of nodes play a critical role in wireless adhoc networks. for energy efficient routing, a connected dominating set (CDS) based virtual backbone is a promising approach. In the… read more here.
Keywords: hop; dominating set; connected dominating; route discovery ... See more keywords
Cluster head selection based on Minimum Connected Dominating Set and Bi-Partite inspired methodology for energy conservation in WSNs
Sign Up to like & getrecommendations! Published in 2018 at "Journal of King Saud University - Computer and Information Sciences"
DOI: 10.1016/j.jksuci.2018.08.009
Abstract: Abstract In a Wireless Sensor Network (WSN), one of the most important issue is to minimize the energy consumption without losing accuracy during faster data transmission. During information broadcast, message communication is to be sent… read more here.
Keywords: methodology; network; energy; cluster head ... See more keywords
Adding Duty Cycle Only in Connected Dominating Sets for Energy Efficient and Fast Data Collection
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2937626
Abstract: In wireless sensor networks (WSNs), energy efficiency and low delay are two pivotal issues for data collection. Wireless sensor networks are composed of energy-constrained sensor nodes. While sensing the environment, the rapid transmission of data… read more here.
Keywords: adcocds scheme; connected dominating; duty cycle; energy ... See more keywords
Parallel Structure From Motion for UAV Images via Weighted Connected Dominating Set
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Geoscience and Remote Sensing"
DOI: 10.1109/tgrs.2022.3222776
Abstract: Incremental structure from motion (ISfM) has been widely used for unmanned aerial vehicle (UAV) image orientation. Its efficiency, however, decreases dramatically due to iterative bundle adjustment (BA). Although the divide-and-conquer strategy has been used for… read more here.
Keywords: structure motion; connected dominating; dominating set; weighted connected ... See more keywords
A matheuristic approach for solving the 2-connected dominating set problem
Sign Up to like & getrecommendations! Published in 2020 at "Applicable Analysis and Discrete Mathematics"
DOI: 10.2298/aadm190227052j
Abstract: This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). The goal of the proposed method is to find near optimal solutions for large graphs. The algorithm is based on a… read more here.
Keywords: approach solving; matheuristic approach; dominating set; connected dominating ... See more keywords