12519 search results - page 49 / 2504 » Approximation Problems Categories |
163
Voted
ESA
2003
Springer
15 years 7 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
128
click to vote
JCO
2010
15 years 1 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
148
click to vote
JCO
2007
15 years 2 months ago
2007
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
113
Voted
STOC
2006
ACM
16 years 2 months 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...
124
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...