539 search results - page 59 / 108 » An Improved Upper Bound for SAT |
OSN
2007
13 years 7 months ago
2007
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
GD
2003
Springer
14 years 26 days ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
DBPL
2007
Springer
13 years 11 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...