15033 search results - page 108 / 3007 » Complexity Theory and Algorithms |
110
click to vote
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
128
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
SYNASC
2006
IEEE
15 years 9 months ago
2006
IEEE
129
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
154
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...