Sciweavers

7006 search results - page 135 / 1402
» Approximation Algorithms
Sort
View
159
Voted
PODC
2009
ACM
16 years 3 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
119
Voted
DEBU
2000
118views more  DEBU 2000»
15 years 2 months ago
Matching Algorithms within a Duplicate Detection System
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...
Alvaro E. Monge
107
Voted
SIAMCO
2000
117views more  SIAMCO 2000»
15 years 2 months ago
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
Vivek S. Borkar, Sean P. Meyn
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 3 months ago
Max cut and the smallest eigenvalue
We describe a new approximation algorithm for Max Cut. Our algorithm runs in ~O(n2 ) time, where n is the number
Luca Trevisan
117
Voted
ESA
2007
Springer
140views Algorithms» more  ESA 2007»
15 years 8 months ago
On Minimum Power Connectivity Problems
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
Yuval Lando, Zeev Nutov