12519 search results - page 165 / 2504 » Approximation Problems Categories |
163
click to vote
ICTCS
2005
Springer
15 years 12 months ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
157
click to vote
DCG
2010
15 years 6 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
155
click to vote
INFORMS
2008
15 years 6 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
173
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
174
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...