275 search results - page 25 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
113
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
STOC
2006
ACM
16 years 15 hour ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
119
click to vote
SODA
1992
ACM
15 years 26 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...