402 search results - page 9 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
APPROX
2000
Springer
13 years 12 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
ICPR
2010
IEEE
14 years 13 days ago
2010
IEEE
Covariance matrices have recently been a popular choice for versatile tasks like recognition and tracking due to their powerful properties as local descriptor and their low comput...
ICCABS
2011
12 years 11 months ago
2011
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
ECCC
2000
13 years 7 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...