Sciweavers

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

97

Voted

ISAAC
2007
Springer

113views Algorithms» more ISAAC 2007»

The Parameterized Complexity of the Unique Coverage Problem

15 years 9 months ago

The Parameterized Complexity of the Unique Coverage Problem

Download www.imsc.res.in

Hannes Moser, Venkatesh Raman, Somnath Sikdar

Real-time Traffic

ISAAC 2007 |

claim paper

Related Content

» Kernelizations for Parameterized Counting Problems

» On the Computational Complexity of Sensor Network Localization

» Query Planning in the Presence of Overlapping Sources

» FixedParameter Algorithms for the k rCenter in Planar Graphs and Map Graphs

» AsymmetryAware RealTime Distributed Joint Resource Allocation in IEEE 80222 WRANs

» A Unifying Local Convergence Result for Newtons Method in Riemannian Manifolds

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ISAAC
Authors	Hannes Moser, Venkatesh Raman, Somnath Sikdar

Comments (0)