9842 search results - page 24 / 1969 » Problem complexity |
ESA
2003
Springer
14 years 26 days 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 ...
FOCS
1997
IEEE
13 years 12 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
FCT
2003
Springer
14 years 25 days ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
APWEB
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
LOGCOM
2010
13 years 6 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...