shown to be NP-hard (more precisely, it is complete for the complexity class FPNP; see function problem), and the decision problem version ("given the costs and a number x, decide whether there is a round-trip route cheaper than x") is NP-complete.
In general, the complexity of query rewriting is NP-complete[5]. If the space of rewrites is relatively small this is not a problem even for integration systems with hundreds of sources.
[edit] Enterprise Information Integration ...
NP-Complete p. 203 class of algorithms conjectured to exhibit worst case performance that cannot be written as a polynomial equation of the number of objects processed. O
objective function p.
 See also: Algorithm, Origin, Weight, Class, Model
  
|
RSS
