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

ICALP

2010

Springer

2010

Springer

Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing problem the sets are required to be pairwise disjoint and their union contained in the universe. When the size of the family is exponential in n, the fastest known algorithms for these problems use inclusion–exclusion and fast zeta transform, taking time and space 2n , up to a factor polynomial in n. Can one improve these bounds to only linear in the size of the family? Here, we answer the question in the aﬃrmative regarding the space requirement, while not increasing the time requirement. Our key contribution is a new fast zeta transform that adapts its space usage to the support of the function to be transformed. Thus, for instance, the chromatic or domatic number of an n-vertex graph can be found in time within a polynomial factor of 2n and space proportional to the number of maximal independent sets,

Related Content

Added |
12 Oct 2010 |

Updated |
12 Oct 2010 |

Type |
Conference |

Year |
2010 |

Where |
ICALP |

Authors |
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |

Comments (0)