Covering and Packing in Linear Space
DOI10.1007/978-3-642-14165-2_61zbMATH Open1288.68102OpenAlexW1843749636MaRDI QIDQ3587422FDOQ3587422
Authors: Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto 
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_61
Recommendations
- Covering and packing in linear space
- scientific article; zbMATH DE number 3897731
- scientific article; zbMATH DE number 480249
- scientific article; zbMATH DE number 2117213
- scientific article; zbMATH DE number 480248
- scientific article; zbMATH DE number 3926633
- Packing and covering with linear programming: a survey
- Simultaneous packing and covering in sequence spaces
- Simultaneous packing and covering in the Euclidean plane
- On a packing and covering problem
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Combinatorial aspects of packing and covering (05B40)
Cited In (10)
- Packing and covering with linear programming: a survey
- Invitation to Algorithmic Uses of Inclusion–Exclusion
- Finding large set covers faster via the representation method
- Random Covering and Packing on the Line
- Set partitioning via inclusion-exclusion
- Covering and packing of rectilinear subdivision
- Covering and packing in linear space
- Trimmed Moebius inversion and graphs of bounded degree
- Trimmed Moebius inversion and graphs of bounded degree
- Title not available (Why is that?)
This page was built for publication: Covering and Packing in Linear Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587422)
