Covering and packing in linear space
- Andreas Björklund,
- ,
- Petteri Kaski,
- Mikko Koivisto
- Lund University,
- Aalto University,
- Helsinki Institute for Information Technology
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-review
Open access
Publication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Journal article
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 1033 (3 pages)Journal (Volume, Issue Number)
Information Processing Letters (Volume 111, Issue 21-22)Publication milestones
- Published - 2011
Publication status
Published - 2011
ISSN
0020-0190Publication IDs
- Scopus: 80054916843
Abstract
Here, we introduce a new, fast zeta transform algorithm that improves the space requirement to only linear in the size of the given set family, while not increasing the time requirement
Publication metrics
PlumX, opens in new tab
Citations
9
Captures
10