12519 search results - page 9 / 2504 » Approximation Problems Categories |
101
click to vote
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
114
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
STOC
2007
ACM
16 years 1 hour ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
STOC
2005
ACM
15 years 5 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...