1272 search results - page 49 / 255 » The Set Cover with Pairs Problem |
139
click to vote
TALG
2008
15 years 19 days ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
99
Voted
CSCLP
2003
Springer
15 years 6 months ago
2003
Springer
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
89
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
105
Voted
GLVLSI
2007
IEEE
15 years 7 months ago
2007
IEEE
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
91
Voted
MOR
2002
15 years 12 days ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...