Titlebook: Algorithms and Computation; 16th International S Xiaotie Deng,Ding-Zhu Du Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 200

A简洁的

Casting an Object with a Core. is the object size. If the test result is positive, a cast with complexity .(..) can be constructed within the same time bound. We also present an example to show that a cast may have Θ(..) complexity in the worst case. Thus, the complexity of our cast is worst-case optimal.

无效

GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Cg it with ideas from mathematical programming, we propose an efficient algorithm for arbitrary .. We prove the convergence of our algorithm and compare it with previously known algorithms. We point out that our algorithm is also applicable to a more general class of constrained optimization problems.

空中

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs matroids: given a matroid . on ground set .=. ∪ ., enumerate all minimal subsets . ⊆ . such that no element . ∈ . is spanned by .. Unlike the above special cases, corresponding to the cycle and cocycle matroids of the graph (.,. ∪ .), the enumeration of cut conjunctions for vectorial matroids turns out to be NP-hard.