1647 search results - page 43 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
131
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
102
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ã...
101
click to vote
IPL
2000
15 years 2 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
121
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
118
click to vote
EMNLP
2006
15 years 3 months ago
2006
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...