4843 search results - page 174 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
ADHOCNOW
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
113
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
143
click to vote
ECCC
2000
15 years 3 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
124
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
161
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
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...