A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set
[article]

2017
*
arXiv
*
pre-print

A k-

arXiv:1510.05886v2
fatcat:64dm4kon3rfbpab4aioi6qdvki
*connected*m-fold*dominating**set*((k,m)-CDS) of a graph G is a node*set*D such that every node in V∖ D has at least m neighbors in D and the subgraph of G induced by D is k-*connected*. ... Using*connected**dominating**set*(CDS) to serve as a virtual backbone in a wireless networks can save energy and reduce interference. ... Let G be a*connected*graph, C be a*dominating**set*of G and C * be a*connected**dominating**set*of G. ...##
###
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
[article]

2014
*
arXiv
*
pre-print

This paper presents a near-optimal distributed approximation algorithm for the minimum-

arXiv:1404.7559v1
fatcat:latkzd3henaxpf5n674yajenqq
*weight**connected**dominating**set*(MCDS) problem. ... Clearly, the*set*of*weight*-1 nodes gives us an optimal*dominating**set*. ... This paper investigates distributed algorithms for approximating minimum-*weight**connected**dominating**set*(MCDS) while taking congestion into account. ...##
###
Parallel Structure from Motion for UAV Images via Weighted Connected Dominating Set
[article]

2022
*
arXiv
*
pre-print

Second, an algorithm, termed

arXiv:2206.11499v2
fatcat:ly2rnr3js5ccrpvaih6cibrgl4
*weighted**connected**dominating**set*(WCDS), is designed to achieve the simplification of the match graph and build the global model, which incorporates the edge*weight*in the ... First, based on vocabulary tree retrieval, match pairs are selected to construct an undirected*weighted*match graph, whose edge*weights*are calculated by considering both the number and distribution of ... Thus, a*weighted**connected**dominating**set*algorithm, termed WCDS, has been designed in this study. ...##
###
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

2011
*
Theoretical Computer Science
*

And the minimum-

doi:10.1016/j.tcs.2009.06.022
fatcat:5xfatczc6narnfaymnjmqrzzca
*weighted**connected**dominating**set*(MWCDS) problem is to find a MWDS such that the graph induced by this subset is*connected*. ... Given a node-*weighted*graph, the minimum-*weighted**dominating**set*(MWDS) problem is to find a minimum-*weighted*vertex subset such that, for any vertex, it is contained in this subset or it has a neighbor ... The Minimum*Dominating**Set*(MDS) problem is to find a*dominating**set*in G with minimum size and the Minimum*Connected**Dominating**Set*(MCDS) problem is to find a*connected**dominating**set*in G with minimum ...##
###
Self-Stabilizing Algorithm for Low Weight Connected Dominating Set

2013
*
2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
*

This new construction is called a Low

doi:10.1109/ds-rt.2013.33
dblp:conf/dsrt/BessaoudBP13
fatcat:blk6zozio5gbjc7am5g7gi2hya
*Weight**Connected**Dominating**Set*(LWCDS). In this paper, we present a selfstabilizing distributed algorithm for the construction of a LWCDS. ... In wireless ad-hoc and sensor networks, a*Connected**Dominating**Set*(CDS) is useful as a virtual backbone due to the absence of fixed infrastructure or centralized management. ... M of V is a minimum*connected**dominating**set*of G (M CDS) if M is a CDS • A subset M of V is a minimum*weighted**connected**dominating**set*of G (M W CDS) if M is a CDS and ∀M a CDS of G, the total*weight*...##
###
New Computation of Resolving Connected Dominating Sets in Weighted Networks

2019
*
Entropy
*

The

doi:10.3390/e21121174
fatcat:nwff7dmqe5azhd6aai72p4jfcy
*connected**dominating**set*(CDS) is a*connected*subset of vertices of G selected to guarantee that all vertices in the graph are*connected*to vertices in the CDS. ... In this paper we focus on the issue related to finding the resolving*connected**dominating**sets*(RCDSs) of a graph, denoted by G. ... Resolving*Connected**Dominating**Set*(RCDS) [21] . A*set*D of vertices of G that is both resolving and*connected**dominating*is a resolving*connected**dominating**set*. ...##
###
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
[chapter]

2014
*
Lecture Notes in Computer Science
*

This paper presents a near-optimal distributed approximation algorithm for the minimumweight

doi:10.1007/978-3-662-43951-7_41
fatcat:nckifhbjdzcxrfmz3yc5yl7jba
*connected**dominating**set*(MCDS) problem. ... Clearly, the*set*of*weight*-1 nodes gives us an optimal*dominating**set*. ... This paper investigates distributed algorithms for approximating minimum-*weight**connected**dominating**set*(MCDS) while taking congestion into account. ...##
###
Finding minimum weight connected dominating set in stochastic graph based on learning automata

2012
*
Information Sciences
*

Finding the minimum

doi:10.1016/j.ins.2012.02.057
fatcat:s6bhj6lierddzcmdtbb3kk65f4
*weight**connected**dominating**set*(MCDS) in an arbitrary graph is an NP-hard problem and several heuristics and approximation methods have been proposed to solve it. ... Forwarding the messages along the virtual backbone induced by the*connected**dominating**set*(CDS) significantly reduces the routing overhead as well as the power consumption by reducing the routing nodes ... A*connected**dominating**set*(CDS) S of a given graph G is a*dominating**set*whose induced sub-graph, denoted hSi, is*connected*, and a minimum size CDS is a CDS with the minimum cardinality. ...##
###
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets

1999
*
Information and Computation
*

These new ideas also lead to improved approximation guarantees for the problem of nding a minimum node

doi:10.1006/inco.1998.2754
fatcat:jgyv7gginve6nel4ljvkrt67cq
*weighted**connected**dominating**set*. ... However, the best known lower bound on the approximation ratio is lnk, assuming that N P 6 DT I M E n O(log log n) ], by a reduction from*set*cover 9, 4]. ... Application to*Connected**Dominating**Sets*The*connected**dominating**set*(CDS) problem is de ned as follows: given a node*weighted*graph G, nd a subset S of vertices of minimum*weight*, such that S induces ...##
###
A Weighted-Density Connected Dominating Set Data Gathering Algorithm for Wireless Sensor Networks

2009
*
Computer and Information Science
*

We propose a

doi:10.5539/cis.v2n4p3
fatcat:np652w4hzrhg3fc4fcakzlhxiy
*weighted*-density*connected**dominating**set*(wDCDS) based data gathering algorithm for wireless sensor networks. ... The wDCDS is constructed using the*weighted*-density of a sensor node, which is defined as the product of the number of neighbors available for the node and the fraction of the initially supplied energy ...*Weighted*-Density based*Connected**Dominating**Set*and Data Gathering Algorithm A*Connected**Dominating**Set*(CDS) of a graph is the*connected*sub-graph of G such that for every vertex v in G, v is either in ...##
###
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
[chapter]

2006
*
Lecture Notes in Computer Science
*

Furthermore, we show how to obtain a constant-factor approximation algorithm for the minimum-

doi:10.1007/11830924_3
fatcat:hvpltc7ql5e3bl4busvrv4465a
*weight**connected**dominating**set*problem in unit disk graphs. ... For a given graph with*weighted*vertices, the goal of the minimum-*weight**dominating**set*problem is to compute a vertex subset of smallest*weight*such that each vertex of the graph is contained in the subset ... The minimum*connected**dominating**set*problem (MCDS) and minimum-*weight**connected**dominating**set*problem (MWCDS) are defined in the obvious way. ...##
###
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs

2010
*
Wireless personal communications
*

In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum

doi:10.1007/s11277-010-9936-4
fatcat:ygosuaenbnepfhutwxs7hqpiom
*weight*Steiner*connected**dominating**set*(WSCDS) problem ... Finding the Steiner*connected**dominating**set*of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. ... After a number of iterations, the algorithm learns how to find the Steiner*connected**dominating**set*with the minimum*weight*. ...##
###
Generating Pictorial Storylines Via Minimum-Weight Connected Dominating Set Approximation in Multi-View Graphs

2021
*
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
*

Then the objects are selected by solving the minimum-

doi:10.1609/aaai.v26i1.8207
fatcat:zqd6njazfncbjd4p2seld3muum
*weighted**connected**dominating**set*problem defined on this graph. ... A key idea in the framework is the use of an approximate solution for the*dominating**set*problem. ... Below we will formulate this problem a the Minimum-*Weight**Connected**Dominating**Set*Problem on a multiview graph, which can be decomposed into two optimization problems: finding a minimum-*weight**dominating*...##
###
Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search

2021

The minimum

doi:10.4230/lipics.cp.2021.39
fatcat:3vmsyi7iozggfgpw47sbbljgyi
*weighted**connected**dominating**set*(MWCDS) problem is an important variant of*connected**dominating**set*problems with wide applications, especially in heterogenous networks and gene regulatory ... Moreover, inner-layer local search method is a general method for maintaining the*connectivity*constraint when dealing with massive graphs. ...*Connected**Dominating**Set*Problem C P 2 0 2 1 39:4 Improving Local Search for Minimum*Weighted**Connected**Dominating**Set*Problem become non-*dominated*by removing u from D and C 2 (u) is the*set*of non-*dominated*...##
###
A Routing Algorithm via Constructing the Weighted Minimum Connected Dominating Set in Mobile Adhoc Network

2017
*
Proceedings of The 7th International Conference on Computer Engineering and Networks — PoS(CENet2017)
*
unpublished

Then, as benefitting from the fact that the fewer nodes provide data forwarding support and the less energy will be consumed, many methods utilize the

doi:10.22323/1.299.0030
fatcat:ergl5tvcunc7vdlfvegsnk3c2m
*connecting**dominate**set*(CDS) to prolong the network ... In this paper, we propose a new greedy approach constructing a*weighted*CDS (Cgreedy-wMCDS) by integrating three factors such as energy, mobility and degree of nodes. ... At first, the algorithm finds a*dominating**set*and then*connects*the*dominating**set*. ...
« Previous

*Showing results 1 — 15 out of 865,764 results*