disc covering problem

COCOON
2005
Springer

95views Combinatorics» more COCOON 2005»

A PTAS for a Disc Covering Problem Using Width-Bounded Separators

14 years 1 months ago

In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, ﬁnd a subset of discs to maximize the area covered by exactly on...

Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu

claim paper

Read More »

click to vote

AAIM
2007
Springer

141views Algorithms» more AAIM 2007»

An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem

14 years 1 months ago

Download cs.panam.edu

The disc covering problem asks to cover a set of points on the plane with a minimum number of ﬁx-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...

Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers