Filters








11,627 Hits in 12.9 sec

Finding Facilities Fast [chapter]

Saurav Pandit, Sriram V. Pemmaraju
2008 Lecture Notes in Computer Science  
Our approach combines ideas from the primal-dual algorithm for facility location due to Jain and Vazirani (JACM, 2001) with recent results on the weighted minimum dominating set problem for UDGs (Huang  ...  The facility location problem is a general abstraction of the clustering problem and this paper presents the first constant-factor approximation algorithm for the facility location problem on unit disk  ...  Future Work One open question implied by this work is whether we can obtain a constant-factor approximation algorithm for facility location on more general classes of wireless network models.  ... 
doi:10.1007/978-3-540-92295-7_5 fatcat:57p4j4xu5zcjlgpynhp5ifbw7i

A Simulation Study on the Strong Neighborhood-Based Stable Connected Dominating Sets For Mobile Ad Hoc Networks

Natarajan Meghanathan
2012 International Journal of Computer Networks & Communications  
We present a detailed simulation based performance study of our recently proposed strong-neighborhood based connected dominating sets (SN-CDS) for mobile ad hoc networks (MANETs).  ...  We compare the performance of SN-CDS with that of the well-known minimum connected dominating sets (MCDS) and the ID-based connected dominating sets (ID-CDS) for MANETs.  ...  The views and conclusions contained in this paper are those of the authors and do not represent the official policies, either expressed or implied, of the funding agency.  ... 
doi:10.5121/ijcnc.2012.4401 fatcat:xz3xc7kbezgqflfm5duqmncxau

Heuristic Approaches for K-Center Problem

Rattan Rana, Deepak Garg
2009 2009 IEEE International Advance Computing Conference  
The k-center problem is one of the basic problems in called as Greedy Heuristic, specifically it is known as Greedyfacility location. The aim is to locate a set of k facilities for a Add.  ...  Although the Greedy-Add and Greedy-Drop provide good Keywords: Heuristic, Facility location, k-center, greedy, (or feasible) solution for location model, but to provide optimizing, consistent a new algorithms  ...  Parekh [7] has made an analysis on simple greedy algorithm for finding small dominating sets in 2. Literature Survey undirected graph of N nodes and M edges.  ... 
doi:10.1109/iadcc.2009.4809031 fatcat:zhrbnpdedrellkqar5toplcmdm

Conflict-Free Coloring of Graphs

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer
2018 SIAM Journal on Discrete Mathematics  
Recall that an open-neighborhood conflict-free coloring is a coloring of some vertices of a graph G such that every vertex has a conflict-free neighbor in its open neighborhood N (v).  ...  Open neighborhoods: Planar conflict-free coloring. In this section we discuss the problem of conflict-free coloring with open neighborhoods.  ... 
doi:10.1137/17m1146579 fatcat:uj3b7rzgsbgb3io4j7njd2i6dy

Efficient integration of multi-hop wireless and wired networks with QoS constraints

Yigal Bejerano
2002 Proceedings of the 8th annual international conference on Mobile computing and networking - MobiCom '02  
The work addresses both the design optimization and the operation aspects of the system.  ...  From the design perspective, we seek for a partition of the network nodes into minimal number of disjoint clusters that satisfy multiple constraints; Each cluster is required to be a connected graph with  ...  Although, the paper consider most of the design aspects of the proposed infrastructure, it leaves some open questions.  ... 
doi:10.1145/570645.570672 dblp:conf/mobicom/Bejerano02 fatcat:te4bizqekrhc3nu2o4aqp7ogm4

Efficient Integration of Multihop Wireless and Wired Networks With QoS Constraints

Y. Bejerano
2004 IEEE/ACM Transactions on Networking  
The work addresses both the design optimization and the operation aspects of the system.  ...  From the design perspective, we seek for a partition of the network nodes into minimal number of disjoint clusters that satisfy multiple constraints; Each cluster is required to be a connected graph with  ...  Although, the paper consider most of the design aspects of the proposed infrastructure, it leaves some open questions.  ... 
doi:10.1109/tnet.2004.838599 fatcat:ognsqnrxqnbptbl7vli5l34gmi

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs [article]

Márcia R. Cappelle, Erika Coelho, Les R. Foulds, Humberto J. Longo
2022 arXiv   pre-print
S is termed open-dominating if every vertex of G has at least one neighbor in S, and open-independent, open-locating-dominating (an OLD_oind-set for short) if no two vertices in G have the same set of  ...  neighbors in S, and each vertex in S is open-dominated exactly once by S.  ...  A natural way to analyze such situations is to make use of open neighborhood sets which may have useful additional properties, such as being open-independent, dominating, open-dominating or open-locating-dominating  ... 
arXiv:2103.07972v4 fatcat:u45xy3f75fh67by6om6edjnbfq

Relative neighborhood graphs and their relatives

J.W. Jaromczyk, G.T. Toussaint
1992 Proceedings of the IEEE  
This is a survey of results on neighborhood graphs. The paper discusses properties, bounds on the size, algorithms, and variants of the neighborhood graphs.  ...  A rich bibliography of the subject concludes the paper.  ...  Senn for her professional help in locating many of the references.  ... 
doi:10.1109/5.163414 fatcat:ddkulebyjjb5rpypvpecdvtske

Routing in Wireless Sensor Networks [chapter]

2017 Network Routing  
We give a survey of state-of-the-art routing techniques with a focus on geographic routing, a paradigm that enables a reactive message-efficient routing without prior route discovery or knowledge of the  ...  We describe design challenges for routing protocols in sensor networks and illustrate the key techniques to achieve desired characteristics, such as energy efficiency and delivery guarantees.  ...  In addition, the related problem of location inaccuracies has to be investigated further on and it remains open to find memoryless solutions, which guarantee delivery even in this case.  ... 
doi:10.1002/9781119114864.ch11 fatcat:2x3gnyy2g5ezjpgyzs7i3txjl4

Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols [chapter]

Philippe Jacquet, Anis Laouiti, Pascale Minet, Laurent Viennot
2002 Lecture Notes in Computer Science  
The random graph is more suitable for the modelization of indoor networks. The unit graph is more suitable for outdoor networks.  ...  network model: the random graph model and the unit graph model.  ...  In the random unit graph model of dimension 1, assuming independence between node location and node IP addresses, the probability that a node does not belong to the dominating set in rule 1 is smaller  ... 
doi:10.1007/3-540-47906-6_31 fatcat:4qaw7turxfgsfjcj2ifkbf2gti

Topology control and routing in ad hoc networks

Rajmohan Rajaraman
2002 ACM SIGACT News  
In Section 2, we describe various aspects relevant to modeling ad hoc networks. In Section 3, we discuss topology control.  ...  While military applications still dominate the research needs in ad hoc networking, the recent rapid advent of mobile telephony and plethora of personal digital assistants has brought to the fore a number  ...  Acknowledgments The author wishes to thank Sergio Rajsbaum for several valuable comments on an earlier draft of this article.  ... 
doi:10.1145/564585.564602 fatcat:bmotwwlq7nbnjlkmkpdz5o75om

Energy-efficient data collection in heterogeneous wireless sensor and actor networks

Waseem Abbas, Hassan Jaleel, Magnus Egerstedt
2013 52nd IEEE Conference on Decision and Control  
In this paper, we address the issue of activity scheduling of sensors in heterogeneous wireless sensor and actor networks (WSANs), thereby proposing an energy-efficient data collection scheme in such networks  ...  In particular, let there be r different types of sensors with each sensor observing a particular sensing parameter.  ...  Let us define the open neighborhood of a vertex v, denoted by N (v), as the set of vertices in G adjacent to v.  ... 
doi:10.1109/cdc.2013.6760528 dblp:conf/cdc/AbbasJE13 fatcat:wdfqu6cyabeyhhr6lf6rz5sany

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs

Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs, Pradip K. Srimani
2005 International Journal of Distributed Sensor Networks  
We provide self-stabilizing algorithms (in the shared-variable ID-based model) for three graph optimization problems: a minimal total dominating set (where every node must be adjacent to a node in the  ...  The paradigm of self-stabilization provides a mechanism to design efficient localized distributed algorithms that are proving to be essential for modern day large networks of sensors.  ...  Since our objective is to explore the algorithmic aspects distributed protocols based on local 1 A preliminary version of the total domination algorithm was presented in [12] 2 A preliminary version  ... 
doi:10.1080/15501320500330745 fatcat:6fq2e2666rh4hpl6y5grdmu4wu

A matheuristic approach for solving the 2-connected dominating set problem

Raka Jovanovic, Stefan Voß
2020 Applicable Analysis and Discrete Mathematics  
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 performance of the proposed method is evaluated on large unit disc graphs having varying edge densities and on general graphs.  ...  In the solution the filled black nodes represent a minimal 2-connected dominating set. Figure 2 : 2 Examples of an open ear decomposition for a bi-connected graph.  ... 
doi:10.2298/aadm190227052j fatcat:c66jnicynrgwrg2gdcfmdkzsvm

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer
2017 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms  
We provide results both for closed neighborhoods N[v], for which a vertex v is a member of its neighborhood, and for open neighborhoods N(v), for which vertex v is not a member of its neighborhood.  ...  For open neighborhoods, we show that every planar bipartite graph has a conflict-free coloring with at most four colors; on the other hand, we prove that for k in 1,2,3, it is NP-complete to decide whether  ...  [22] present a linear time algorithm for finding a minimum dominating set in a series-parallel graph, which includes outerplanar graphs.  ... 
doi:10.1137/1.9781611974782.127 dblp:conf/soda/AbelADFGHKS17 fatcat:swnroxpghrgcbjwzixamj3gb5i
« Previous Showing results 1 — 15 out of 11,627 results