Sciweavers

613 search results - page 38 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
13 years 7 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
STACS
2009
Springer
14 years 2 months ago
On Approximating Multi-Criteria TSP
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
Bodo Manthey
FSTTCS
2000
Springer
13 years 11 months ago
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
Michael R. Fellows, Catherine McCartin, Frances A....
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
14 years 1 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh