A PTAS for a disc covering problem using width-bounded separators
Zhixiang Chen (),
Bin Fu (),
Yong Tang () and
Binhai Zhu ()
Additional contact information
Zhixiang Chen: University of Texas—Pan American
Bin Fu: University of New Orleans
Yong Tang: Sun Yat-Sen University
Binhai Zhu: Montana State University
Journal of Combinatorial Optimization, 2006, vol. 11, issue 2, No 7, 203-217
Abstract:
Abstract In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane and centers on the grid points, find a subset of discs to maximize the area covered by exactly one disc. This problem originates from the application in digital halftoning, with the best known approximation factor being 5.83 (Asano et al., 2004). We show that if their radii are between two positive constants, then there exists a polynomial time approximation scheme. Our techniques are based on the width-bounded geometric separator recently developed in Fu and Wang (2004), Fu (2006).
Keywords: Width-bounded separator; Disc covering; Approximation algorithms; Randomized algorithms (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-7132-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:11:y:2006:i:2:d:10.1007_s10878-006-7132-y
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-006-7132-y
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().