7930 search results - page 300 / 1586 » Greedy in Approximation Algorithms |
220
click to vote
CCCG
2010
15 years 8 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
220
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
200
click to vote
STOC
2005
ACM
16 years 24 days ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
152
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
183
click to vote
COCOON
2005
Springer
16 years 23 days ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...