<--- Back to Details
First PageDocument Content
Mathematics / Dominating set / Unit disk graph / Independent set / APX / Approximation algorithm / Vertex cover / Planar separator theorem / Theoretical computer science / Graph theory / NP-complete problems
Date: 2011-08-06 04:11:13
Mathematics
Dominating set
Unit disk graph
Independent set
APX
Approximation algorithm
Vertex cover
Planar separator theorem
Theoretical computer science
Graph theory
NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: 2011.cccg.ca

Download Document from Source Website

File Size: 197,44 KB

Share Document on Facebook

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document