7015 search results - page 144 / 1403 » Approximation algorithms for co-clustering |
131
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
130
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
119
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
127
click to vote
JCO
2010
15 years 1 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
150
click to vote
ISAAC
2000
Springer
15 years 6 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...