840 search results - page 1 / 168 » Inapproximability of Combinatorial Optimization Problems |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
IJCAI
2001
13 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
SODA
2010
ACM
13 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
WINE
2005
Springer
13 years 10 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...