Computational Approaches to Lattice Packing and Covering Problems

Achill Schurmann; Frank Vallentin

doi:10.1007/s00454-005-1202-2

Computational Approaches to Lattice Packing and Covering Problems

Discrete & Computational Geometry ◽

10.1007/s00454-005-1202-2 ◽

2005 ◽

Vol 35 (1) ◽

pp. 73-116 ◽

Cited By ~ 16

Author(s):

Achill Schurmann ◽

Frank Vallentin

Keyword(s):

Lattice Packing ◽

Computational Approaches ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-31833-0_2 ◽

2005 ◽

pp. 6-8

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Bin Packing and Covering Problems with Rejection

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/11533719_89 ◽

2005 ◽

pp. 885-894

Author(s):

Yong He ◽

György Dósa

Keyword(s):

Bin Packing ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Structural Packing and Covering Problems

Research Problems in Discrete Geometry ◽

10.1007/0-387-29929-7_3 ◽

2006 ◽

pp. 75-120

Keyword(s):

Covering Problems ◽

Packing And Covering

Download Full-text

Fast LP-based Approximations for Geometric Packing and Covering Problems

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611975994.62 ◽

2020 ◽

pp. 1019-1038

Author(s):

Chandra Chekuri ◽

Sariel Har-Peled ◽

Kent Quanrud

Keyword(s):

Covering Problems ◽

Packing And Covering ◽

Geometric Packing

Download Full-text

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Algorithmica ◽

10.1007/s00453-019-00670-w ◽

2020 ◽

Vol 82 (6) ◽

pp. 1703-1739

Author(s):

Michał Pilipczuk ◽

Erik Jan van Leeuwen ◽

Andreas Wiese

Keyword(s):

Polynomial Time ◽

Planar Graphs ◽

Approximation Schemes ◽

Covering Problems ◽

Packing And Covering ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text

Exact algorithms and APX-hardness results for geometric packing and covering problems

Computational Geometry ◽

10.1016/j.comgeo.2012.04.001 ◽

2014 ◽

Vol 47 (2) ◽

pp. 112-124 ◽

Cited By ~ 31

Author(s):

Timothy M. Chan ◽

Elyot Grant

Keyword(s):

Exact Algorithms ◽

Covering Problems ◽

Packing And Covering ◽

Geometric Packing

Download Full-text

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems

Algorithmica ◽

10.1007/s00453-015-9995-8 ◽

2015 ◽

Vol 74 (4) ◽

pp. 1205-1223 ◽

Cited By ~ 1

Author(s):

Pierre Fraigniaud ◽

Magnús M. Halldórsson ◽

Boaz Patt-Shamir ◽

Dror Rawitz ◽

Adi Rosén

Keyword(s):

Covering Problems ◽

Packing And Covering

Download Full-text

Hardness of approximation for orthogonal rectangle packing and covering problems

Journal of Discrete Algorithms ◽

10.1016/j.jda.2009.02.002 ◽

2009 ◽

Vol 7 (3) ◽

pp. 291-305 ◽

Cited By ~ 9

Author(s):

Miroslav Chlebík ◽

Janka Chlebíková

Keyword(s):

Hardness Of Approximation ◽

Covering Problems ◽

Packing And Covering ◽

Rectangle Packing

Download Full-text

Approximation Algorithms for Mixed Fractional Packing and Covering Problems

IFIP International Federation for Information Processing - Exploring New Frontiers of Theoretical Informatics ◽

10.1007/1-4020-8141-3_19 ◽

2006 ◽

pp. 223-236 ◽

Cited By ~ 2

Author(s):

Klaus Jansen

Keyword(s):

Approximation Algorithms ◽

Covering Problems ◽

Packing And Covering

Download Full-text

Kernels for Packing and Covering Problems

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29700-7_19 ◽

2012 ◽

pp. 199-211 ◽

Cited By ~ 7

Author(s):

Jianer Chen ◽

Henning Fernau ◽

Peter Shaw ◽

Jianxin Wang ◽

Zhibiao Yang

Keyword(s):

Covering Problems ◽

Packing And Covering

Download Full-text