Titlebook: Combinatorial Optimization and Applications; 7th International Co Peter Widmayer,Yinfeng Xu,Binhai Zhu Conference proceedings 2013 Springer

gain631

Approximation Algorithms for the Maximum Multiple RNA Interaction Problemthe problem when the order of interacting RNAs is known and pseudoknot interactions are allowed; for the general problem without an assumed RNA order, we prove the NP-hardness for both variants (allowing and disallowing pseudoknot interactions), and present a constant ratio approximation algorithm for each of them.

META

On the Clustered Steiner Tree Problem case, in which . is the approximation ratio for the Steiner tree problem. When the topologies for all clusters are given, we show a (. + 1)-approximation algorithm. We also discuss the Steiner ratio for this problem. We show the ratio is lower and upper bounded by three and four, respectively.

IVORY

Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations oop in comparison with techniques implemented in the Omega and ISL libraries. This increases the applicability scope of techniques based on transitive closure of dependence graphs. Experimental results for NASA Parallel Benchmarks are discussed.

GEON

Eclampsia

Juvenile

珊瑚

马笼头

Fsh238

Discretely Following a Curvesed on unique or non-unique nodes and on limiting the number of points used. We prove that three of the variations of the set-chain matching problem are .-complete. For the version of the problem that we prove is polynomial, we give the optimal substructure and the recurrence for a dynamic programming solution.

Insufficient