Sciweavers

7129 search results - page 53 / 1426
» Approximation Algorithms for Treewidth
Sort
View
IEICET
2010
124views more  IEICET 2010»
14 years 7 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 3 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
COR
2006
122views more  COR 2006»
14 years 9 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
CORR
2006
Springer
146views Education» more  CORR 2006»
14 years 9 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
JAT
2006
64views more  JAT 2006»
14 years 9 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger