Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks

Authors:
Xiang-Yang Li;Yu Wang
Affiliations:
Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL
Venue:
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Year:
2002

Citing 7
Cited 7

Unit disk graphs

Discrete Mathematics - Topics on domination
An optimal algorithm for finding dominating cycles in circular-arc graphs

Discrete Applied Mathematics
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Geometric Spanners for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Distributed low-cost backbone formation for wireless ad hoc networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
On maximizing the throughput of convergecast in wireless sensor networks

GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless ad hoc networks, each wireless device has a transmission range, which is usually modeled as a disk centered at this node. A wireless node can send message directly to all nodes lying inside this disk. We present several intersection graphs to model the wireless networks. Then we present some simple heuristics and/or PTASs to approximate the maximum independent set, the minimum vertex cover and the minimum graph coloring in these graph models.