7930 search results - page 115 / 1586 » Greedy in Approximation Algorithms |
158
click to vote
AAAI
2008
15 years 8 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...
186
click to vote
INFOCOM
2008
IEEE
16 years 22 days ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
134
click to vote
DAM
1998
15 years 6 months ago
1998
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...
174
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
127
click to vote
TRS
2008
15 years 6 months ago
2008
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...