Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd We prove that the worst-case time and space complexity of our algorithm is ( n lg ( n/t ) + T MST ( v, v ) + nT SMT ( t )/ t ) and... K Kalpakis,AT Sherman - 《Networks》 被引...
In this case, computing the worst case cost implies the solution of a quadratic maximization problem with a computational complexity that is exponential with the prediction horizon. In this paper an efficient upper bound of a quadratic maximization problem over a hypercube is presented. It is based...