291 search results - page 49 / 59 » Factor 2 Approximation Algorithm for the Generalized Steiner... |
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
PODC
2005
ACM
14 years 27 days ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
ADHOCNOW
2009
Springer
13 years 8 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...