1389 search results - page 76 / 278 » Improved Approximation Algorithms for Label Cover Problems |
118
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
120
click to vote
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
128
click to vote
APPROX
1998
Springer
15 years 7 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
148
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
108
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...