361 search results - page 35 / 73 » Maximum subset intersection |
112
Voted
MST
2010
15 years 21 days ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
115
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
119
click to vote
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
183
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
109
Voted
MST
2010
15 years 21 days ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...