Paper

Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

2002

Created by Alysson Bolognesi Prado at 2019-03-28 10:13:23.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

3

Andréa W. Richa

Venue

1

Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications - DIALM ’02

References

13

A unified approach to approximation algorithms for bottleneck problems

Approximation schemes for covering and packing problems in image processing and VLSI

Approximation algorithms for hitting objects with straight lines

Multicluster, mobile, multimedia radio network

Discrete mobile centers

Erratum: Generalized Selection and Ranking: Sorted Matrices