A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Fast distributed construction of small k-dominating sets and applications
Journal of Algorithms
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Naps: scalable, robust topology management in wireless ad hoc networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: efficient clustering in unstructured radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
On Optimal Placement of Intrusion Detection Modules in Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Distributed approximation: a survey
ACM SIGACT News
Distributed low-cost backbone formation for wireless ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the node-scheduling approach to topology control in ad hoc networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Facility location: distributed approximation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A framework for time indexing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Bounded-Latency Content Distribution: Feasibility and Evaluation
IEEE Transactions on Computers
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Maximizing remote work in flooding-based peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
IEEE Transactions on Mobile Computing
Distributed algorithms for weighted problems in sparse graphs
Journal of Discrete Algorithms
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Assigning game server roles in mobile ad-hoc networks
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Ad hoc networks beyond unit disk graphs
Wireless Networks
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Construction of virtual backbone on growth-bounded graph with variable transmission range
WSEAS Transactions on Computers
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Return of the primal-dual: distributed metric facilitylocation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Algorithms for ad hoc and sensor networks
Computer Communications
Efficient Power Utilization in Multi-radio Wireless Ad Hoc Networks
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
The algorithm of connected dominating set based clustering in sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Cooperative caching and relaying strategies for peer-to-peer content delivery
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Solving generic role assignment exactly
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Computer Networks: The International Journal of Computer and Telecommunications Networking
GAPs: Geospatial Abduction Problems
ACM Transactions on Intelligent Systems and Technology (TIST)
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Distributed approximation algorithms for planar graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Wireless networking: graph theory unplugged
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Interference minimum network topologies for ad hoc networks
Wireless Communications & Mobile Computing
A weight-value algorithm for finding connected dominating sets in a MANET
Journal of Network and Computer Applications
On the locality of some NP-complete problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Distributed approximation algorithms for weighted problems in minor-closed families
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Secure local algorithm for establishing a virtual backbone in 3D ad hoc network
International Journal of Networking and Virtual Organisations
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Intra-AS cooperative caching for content-centric networks
Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking
Hi-index | 0.00 |
Finding a small dominating set is one of the most fundamental problems of traditional graph theory. In this paper, we present a new fully distributed approximation algorithm based on LP relaxation techniques. For an arbitrary parameter k and maximum degree Δ, our algorithm computes a dominating set of expected size O(kΔ2/k log Δ|DSOPT|) in O(k2) rounds where each node has to send O(k2Δ) messages of size O(logΔ). This is the first algorithm which achieves a non-trivial approximation ratio in a constant number of rounds.