Sciweavers

841 search results - page 2 / 169
» Approximability of Minimum AND-Circuits
Sort
View
TASLP
2010
122views more  TASLP 2010»
13 years 5 days ago
Error Approximation and Minimum Phone Error Acoustic Model Estimation
Minimum phone error (MPE) acoustic parameter estimation involves calculation of edit distances (errors) between correct and incorrect hypotheses. In the context of large vocabulary...
Matt Gibson 0002, Thomas Hain
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
13 years 9 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
Jianer Chen, Iyad A. Kanj
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 3 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
JCO
2010
182views more  JCO 2010»
13 years 3 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
COLOGNETWENTE
2008
13 years 6 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze