791 search results - page 52 / 159 » Approximating the Maximum Sharing Problem |
139
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
155
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
150
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
155
click to vote
JACM
1998
15 years 5 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
186
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...