Sciweavers

Share
ICALP
2001
Springer
9 years 11 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
CCGRID
2003
IEEE
10 years 1 days ago
A Parallel FPT Application For Clusters
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
James Cheetham, Frank K. H. A. Dehne, Andrew Rau-C...
books