9842 search results - page 190 / 1969 » The Complexity of the Matching-Cut Problem |
CCCG
2010
13 years 12 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
AAAI
2006
13 years 11 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
EOR
2010
13 years 10 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
CPM
1999
Springer
14 years 2 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
CRYPTO
2008
Springer
14 years 5 days ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...