9842 search results - page 196 / 1969 » The Complexity of the Matching-Cut Problem |
MICS
2010
13 years 8 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
FSTTCS
1993
Springer
14 years 2 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
ICCBR
1995
Springer
14 years 1 months ago
1995
Springer
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
WSC
2008
14 years 22 days ago
2008
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...