4894 search results - page 113 / 979 » The Guarding Problem - Complexity and Approximation |
199
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
173
click to vote
ACL2
2006
ACM
16 years 10 days ago
2006
ACM
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
155
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...
195
click to vote
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of a...
178
click to vote
CPM
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...