8728 search results - page 1341 / 1746 » On Reduct Construction Algorithms |
189
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
159
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
199
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
165
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The National Association for Stock Car Auto Racing (NASCAR) is currently the No. 1 spectator sport in the United States. However, the manner in which drivers are ranked to determi...
210
click to vote
ICANNGA
2009
Springer
16 years 1 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...