Sciweavers

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

32

APPROX
2006
Springer

favoriteEmaildiscussreport

126views Algorithms» more APPROX 2006»

Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems

14 years 2 months ago

Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems

Download www.openu.ac.il

Zeev Nutov

Real-time Traffic

Algorithms | APPROX 2006 |

claim paper

Related Content

» Minimum Vertex Cover in Rectangle Graphs

» On Minimum Power Connectivity Problems

» Connected Vertex Covers in Dense Graphs

» Approximating node connectivity problems via set covers

» ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...

» The minimum linear arrangement problem on proper interval graphs

» A Unified Approach to Approximating Partial Covering Problems

» Approximating Directed WeightedDegree Constrained Networks

» Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	APPROX
Authors	Zeev Nutov

Comments (0)