... An improved lower bound on approximation algorithms for the Closest Substring problem . ” Inf Process Lett , 107 : 24–28 , 2008 . 54. M.S. Waterman . Introduction to Computational Biology . Chapman and Hall , New York , 1995 . 55. S. Wu ...
... algorithms for closest string and related problems . Algorithmica 37 , 25–42 ( 2003 ) [ 7 ] Wang , J. , Chen , J. , Huang , M. , et al .: An Improved Lower Bound on Approximation Alogorithms for the Closest Substring Problem . Science ...
... Lower Bound on Approximation Algorithms for the Closest Substring Problem ... Improved Approximation Algorithm for Connected Facility Location Problems (Extended Abstract)..................................... 311 Mohammad Khairul Hasan ...
... problem (given a graph G and a parameter k, decide if the graph contains a simple path of length k) started with an algorithm of running time 2kk!mO(1), proposed in 1985 [35]. It was ... Lower Bounds on Approximation Algorithms.
Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions.
... problem formulation of CLOSEST SUBSTRING. For example, Sagot [9] studies motif discovery by solving CLOSEST ... improved to nO(log1/), matching the bound derived from Theorem 4. Cross References The following problems are close ...
In applications as diverse as data placement in peer-to-peer systems, control of epidemic outbreaks, and routing in sensor networks, the fundamental questions can be abstracted as problems in combinatorial optimization.
... algorithm that achieves a + o ( 1 ) approximation guarantee . Li et al . [ 17 ] proved the existence of a polynomial time approximation scheme ( PTAS ) for this problem , though the high degree in the polynomial complexity of the PTAS ...
This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002.
... lower bound of Ω(1/ε2) for εn-additive approximation. 1.2 Results for Lempel-Ziv We prove that approximating compressibility with respect to LZ is closely related to the following problem ... algorithms and lower bounds for this problem ...