In our problem we are given a set of customers, their positions on the
plane and their demands. Geometrically, directional antenna with
parameters \alpha,\rho,R is a set
of points with radial coordinates (\theta,r) such that
\alpha \le \theta \le \alpha+\rho and r \le R. Given a set of
possible directional ... more >>>

An algorithm is presented for counting the number of maximum weight satisfying assignments of a 2SAT formula. The worst case running time of O(\mbox{poly(n)} \cdot 1.2461^n) for formulas with n variables improves on the previous bound of O(\mbox{poly(n)} \cdot 1.2561^n) by Dahll\"of, Jonsson, and Wahlstr\"om . The weighted 2SAT counting ... more >>>