7006 search results - page 330 / 1402 » Approximation Algorithms |
121
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
137
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
172
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
154
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
143
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...