17 search results - page 2 / 4 » Autoreducibility of NP-Complete Sets |
TON
2012
11 years 8 months ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
DM
2010
13 years 6 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
CEC
2005
IEEE
13 years 8 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
IANDC
2006
13 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
COCO
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...