1389 search results - page 195 / 278 » Improved Approximation Algorithms for Label Cover Problems |
143
click to vote
EC
2000
15 years 2 months ago
2000
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
110
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
174
click to vote
STOC
2012
ACM
13 years 5 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
114
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
125
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...