7006 search results - page 7 / 1402 » Approximation Algorithms |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
SODA
2010
ACM
14 years 4 months ago
2010
ACM
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
FCT
2007
Springer
14 years 26 days ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...