17329 search results - page 5 / 3466 » Improved non-approximability results |
PRICAI
2010
Springer
13 years 7 months ago
2010
Springer
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
JCSS
2011
13 years 3 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
FEDCSIS
2011
12 years 8 months ago
2011
—Nowadays, embedded systems are widely used. It is extremely difficult to analyze safety issues in embedded systems, to relate the safety analysis results to the actual parts, a...
WSDM
2012
ACM
12 years 4 months ago
2012
ACM
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
SIAMCOMP
1998
13 years 8 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...