90 search results - page 16 / 18 » An improved approximation ratio for the minimum linear arran... |
AAAI
2010
13 years 9 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...