369 search results - page 28 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
129
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
ISCAS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
AAAI
2008
15 years 2 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
WINE
2009
Springer
15 years 6 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
115
click to vote
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...