Independent and dominating sets in wireless communication graphs

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Unknown venue

• Publication date

  2006-04-06

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Complexity Zoo

  2008cited by this paper
• A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs

  2005cited by this paper
• Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs

  2005cited by this paper
• Local approximation schemes for ad hoc and sensor networks

  2005cited by this paper
• On the Advantages of Clusterbased Routing in Wireless Sensor Networks

  2005cited by this paper
• Algorithms for Wireless Sensor Networks

  2005cited by this paper
• Advantages of a TDMA based, energy-efficient, self-organizing MAC protocol for WSNs

  2004cited by this paper
• Wireless communication graphs

  2004cited by this paper
• Virtual coordinates for ad hoc and sensor networks

  2004cited by this paper
• Unit disk graph approximation

  2004cited by this paper
• On the complexity of fixed parameter clique and dominating set

  2004cited by this paper
• On cyclic plans for scheduling a smart card personalisation system

  2004cited by this paper
• Triangulation and embedding using small sets of beacons

  2004cited by this paper
• Local, distributed topology control for large-scale wireless ad-hoc networks

  2004cited by this paper
• Navigating nets: simple algorithms for proximity search

  2004cited by this paper
• A robust PTAS for maximum independent sets in unit disk graphs

  2004cited by this paper
• Prolonging the lifetime of wireless sensor networks by cross-layer interaction

  2004cited by this paper
• EYES - Energy Efficient Sensor Networks

  2003cited by this paper
• Ad hoc networks beyond unit disk graphs

  2003cited by this paper
• Plongements lipschitziens dans Rn

  2003cited by this paper
• Collaborative algorithms for communication in wireless sensor networks

  2003cited by this paper
• The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks

  2003cited by this paper
• A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks

  2003cited by this paper
• A new PTAS for maximum independent sets in unit disk graphs

  2003cited by this paper
• An energy-efficient MAC protocol for wireless sensor networks

  2002cited by this paper
• Multipath Routing for Data Dissemination in Energy Efficient Sensor Networks

  2002cited by this paper
• Robust algorithms for restricted domains

  2001cited by this paper
• Approximation schemes-a tutorial

  2001cited by this paper
• Polynomial-time approximation schemes for geometric graphs

  2001cited by this paper
• Load-balancing clusters in wireless ad hoc networks

  2000cited by this paper
• Clique is hard to approximate withinn1−ε

  1999influential reference
• Ad-hoc on-demand distance vector routing

  1999cited by this paper
• The Broadcast Storm Problem in a Mobile Ad Hoc Network

  1999cited by this paper
• CEDAR: a core-extraction distributed ad hoc routing algorithm

  1999cited by this paper
• Label placement by maximum independent set in rectangles

  1998cited by this paper
• Unit disk graph recognition is NP-hard

  1998cited by this paper
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

  1998cited by this paper
• Clique Is Hard to Approximate within N 1?

  1997cited by this paper
• Clique is hard to approximate within n/sup 1-/spl epsiv//

  1996cited by this paper
• A comparison of sequential Delaunay triangulation algorithms

  1995cited by this paper
• Multicluster, mobile, multimedia radio network

  1995cited by this paper
• A compendium of NP optimization problems

  1994cited by this paper
• Simple heuristics for unit disk graphs

  1994cited by this paper
• Approximating the Minimum Maximal Independence Number

  1993influential reference
• Distributed Algorithms

  1992cited by this paper
• Improved distributed algorithms for coloring and network decomposition problems

  1992cited by this paper
• Locality in Distributed Graph Algorithms

  1992influential reference
• Approximating maximum independent sets by excluding subgraphs

  1990cited by this paper
• Network decomposition and locality in distributed computation

  1989cited by this paper
• Complexity of network synchronization

  1985cited by this paper
• A simple parallel algorithm for the maximal independent set problem

  1985cited by this paper
• Approximation Schemes for Covering and Packing Problems in Robotics and VLSI

  1984cited by this paper
• Efficient bounds for the stable set, vertex cover and set packing problems

  1983influential reference
• Approximation algorithms for NP-complete problems on planar graphs

  1983cited by this paper
• The complexity of theorem-proving procedures

  1971influential reference
• Advantages of a TDMA based , energy-efficient , self-organizing MAC protocol for WSNs

  year unknowncited by this paper

• Application of Scopious Stark Domination in Optimization

  2024cites this paper
• Application of Point Shelter Set in Optimization

  2024influential citation
• Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks

  2023cites this paper
• Coverage Aware Scheduling Strategies for 3D Wireless Video Sensor Nodes to Enhance Network Lifetime

  2021cites this paper
• Independent (k+1)-domination in k-trees

  2020cites this paper
• Optimization Problems, Models, and Heuristics in Wireless Sensor Networks

  2018cites this paper
• Virtual coordinate system using dominating set for GPS-free adhoc networks

  2017cites this paper
• A SINR Guaranteed Power and Spectrum Allocation Algorithm for Cognitive Networks

  2012cites this paper
• 0 Review of Optimization Problems in Wireless Sensor Networks

  2012influential citation
• An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs

  2012cites this paper
• Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs

  2012cites this paper
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs

  2012cites this paper
• Embedding of virtual network requests over static wireless multihop networks

  2012cites this paper
• A SINR Guaranteed Power and Spectrum Allocation Algorithm for Cognitive Networks

  2012cites this paper
• Review of Optimization Problems in Wireless Sensor Networks

  2012influential citation
• Oblivious buy-at-bulk network design algorithms

  2011cites this paper
• Virtual network embedding in wireless multihop networks

  2011cites this paper
• An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems

  2010cites this paper
• Approximated Matching-Based Spectrum Access Algorithm for Heterogenous Cognitive Networks

  2009cites this paper
• Wireless Sensor Networks in Motion - Clustering Algorithms for Service Discovery and Provisioning

  2008cites this paper
• Distributed and Self-Organizing Data Management Strategies for Wireless Sensor Networks. A Cross-Layered Approach

  2008cites this paper
• A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks

  2008cites this paper
• Sensors on speaking terms : schedule-based medium access control protocols for wireless sensor networks

  2007cites this paper
• A distributed and self-organizing scheduling algorithm for energy-efficient data aggregation in wireless sensor networks

  2007cites this paper
• Reliable routing protocols for dynamic wireless ad hoc and sensor networks

  2007cites this paper
• Sparse cuts, matching-cuts and leafy trees in graphs

  2006influential citation
• The domination and independent domination numbers of Goldberg Graphs

  year unknowncites this paper