3874 search results - page 246 / 775 » Approximation Algorithms for k-hurdle Problems |
136
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
146
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
145
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
129
click to vote
CPM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
149
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...