1272 search results - page 80 / 255 » Approximate Parameterized Matching |
171
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
143
click to vote
COMGEO
2007
ACM
15 years 3 months ago
2007
ACM
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...
156
Voted
SODA
2010
ACM
15 years 1 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
128
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
135
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...