Titlebook: Experimental Algorithms; 9th International Sy Paola Festa Conference proceedings 2010 Springer-Verlag Berlin Heidelberg 2010 ARC.algorithm

collagenase

Stefan G. E. Roberts,Michael R. Green using greedy and LP-based rounding elements. Experiments show that these ideas significantly reduce the rounding errors..For an important special case of max-coverage, namely unit disk max-domination, we also develop a PTAS. However, experiments show it less competitive than other approaches, except possibly for extremely high solution qualities.

突袭

痴呆

孵卵器

Maximum Cliques in Protein Structure Comparisonconceived by Östergȧrd. On a popular benchmark (the Skolnick set) we observe that ACF is about 20 times faster in average than the Östergȧrd’s algorithm. We then successfully use DAST’s alignments to obtain automatic classification in very good agreement with SCOP.

Schlemms-Canal

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements using greedy and LP-based rounding elements. Experiments show that these ideas significantly reduce the rounding errors..For an important special case of max-coverage, namely unit disk max-domination, we also develop a PTAS. However, experiments show it less competitive than other approaches, except possibly for extremely high solution qualities.

飞行员

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price AlgorithmTSP formulation and give a way to lift them. We obtain good computational results with a branch-cut-and-price algorithm using the new cuts, solving several instances of reasonable size at the root node.

制定

Highbrow

Bit-Parallel Search Algorithms for Long Patternseriments show that the new algorithms are competitive with earlier algorithms with or without bit-parallelism. The average time complexity of the algorithms is analyzed. Two of the algorithms are shown to be optimal on average.

口诀

启发