Compressing rectilinear pictures and minimizing access control lists

MaRDI QIDQ2934701zbMATH OpenFDO

Authors David A. Applegate, Gruia Calinescu, Katrina Ligett, Jia Wang, D. S. Johnson, Howard Karloff

Publication date 18 December 2014

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Faster compression of patterns to rectangle rule lists
• Faster compression of patterns to rectangle rule lists
• Internet packet filter management and rectangle geometry
• A hybrid heuristic for the rectilinear picture compression problem
• Compressing two-dimensional routing tables

Cited in

(7)

• Snipperclips: cutting tools into desired polygons using themselves
• Composing Functions to Minimize Image Size
• The 2D subarray polytope
• A hybrid heuristic for the rectilinear picture compression problem
• Faster compression of patterns to rectangle rule lists
• Faster compression of patterns to rectangle rule lists
• The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations

This page was built for publication: Compressing rectilinear pictures and minimizing access control lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934701)