Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

84

Voted

ALGORITHMICA
2008

59views more ALGORITHMICA 2008»

An Optimal Algorithm for the Minimum Disc Cover Problem

15 years 2 months ago

An Optimal Algorithm for the Minimum Disc Cover Problem

Download cgm.cs.ntust.edu.tw

Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang

Real-time Traffic

ALGORITHMICA 2008 |

claim paper

Related Content

» Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks

» An Almost Linear Time 28334Approximation Algorithm for the Disc Covering Problem

» A PTAS for a Disc Covering Problem Using WidthBounded Separators

» A Hybrid Genetic Algorithm for Minimum Vertex Cover Problem

» Local Maximal Matching and Local 2Approximation for Vertex Cover in UDGs

» On minimum m connected k dominating set problem in unit disc graphs

» Interference in Cellular Networks The Minimum Membership Set Cover Problem

» Polynomial time approximation schemes for minimum disk cover problems

» Greedy Algorithms for Minimisation Problems in Random Regular Graphs

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2008
Where	ALGORITHMICA
Authors	Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang Lai

Comments (0)