IEEE Transactions on Information Theory · 2010 · 24 citations · 15 references
ComputingComputer ScienceAlgorithmsComputational GeometryOptimizationConstrained OptimizationConstraint AnalysisCombinatorial ConstraintsConstraintsLower BoundsUpper Bounds
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> A method for computing lower bounds on capacities of two-dimensional (2D) constraints having a symmetric presentation in either the horizontal or the vertical direction is presented. The method is a generalization of the method of Calkin and Wilf (SIAM <emphasis emphasistype="italic">J. Discrete Math.</emphasis>, 1998). Previous best lower bounds on capacities of certain constraints are improved using the method. It is also shown how this method, as well as their method for computing upper bounds on the capacity, can be applied to constraints which are not of finite-type. Additionally, capacities of two families of multidimensional constraints are given exactly. </para>
15
The statistics of dimers on a lattice
Piet Kasteleyn · Physica · 1961 · 1.3K citations
Reiner Horst, Nguyen‐Van Thoai · Journal of Optimization Theory and Applications · 1999 · 683 citations