Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks
- 28 September 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A mobility-based framework for adaptive clustering in wireless ad hoc networksIEEE Journal on Selected Areas in Communications, 1999
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- Adaptive clustering for mobile wireless networksIEEE Journal on Selected Areas in Communications, 1997
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- The searching over separators strategy to solve some NP-hard problems in subexponential timeAlgorithmica, 1993
- The slab dividing approach to solve the EuclideanP-Center problemAlgorithmica, 1993
- Approximation algorithms for hitting objects with straight linesDiscrete Applied Mathematics, 1991
- An optimal approximation algorithm for the rectilinearm-center problemAlgorithmica, 1990
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985