1389 search results - page 98 / 278 » Improved Approximation Algorithms for Label Cover Problems |
152
click to vote
FAW
2010
Springer
15 years 1 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
141
click to vote
MOC
2002
15 years 2 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
118
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
179
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
138
click to vote
SODA
2010
ACM
16 years 16 days ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...