1941 search results - page 42 / 389 » On the Hardness of Approximate Reasoning |
133
click to vote
ESA
2003
Springer
15 years 5 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 ...
105
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
105
click to vote
DEXA
2010
Springer
15 years 28 days ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
116
click to vote
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
111
click to vote
ICMCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Limited bandwidth and high packet loss pose a serious challenge for video streaming over wireless networks. Even when packet loss in the medium is not present, the fluctuating ava...