Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs release_77lru66izzakhhqkhdetgdiqse

by Guilherme D. da Fonseca, Vinícius G. Pereira de Sá, Celina M. H. de Figueiredo

Released as a article .

2014  

Abstract

Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy that allows us to obtain linear-time constant-factor approximation algorithms for such problems. To illustrate the applicability of the proposed variation, we obtain results for three well-known optimization problems. Among such results, the proposed method yields linear-time (4+eps)-approximation for the maximum-weight independent set and the minimum dominating set of unit disk graphs, thus bringing significant performance improvements when compared to previous algorithms that achieve the same approximation ratios. Finally, we use axis-aligned rectangles to illustrate that the same method may be used to derive linear-time approximations for problems on other geometric intersection graph classes.
In text/plain format

Archived Files and Locations

application/pdf  362.3 kB
file_de5tlhwyznaxjmah7qklqd2tlq
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-05-05
Version   v2
Language   en ?
arXiv  1402.4722v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 318c6f36-28fa-4761-beac-7208976f3584
API URL: JSON