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...
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...