4894 search results - page 97 / 979 » The Guarding Problem - Complexity and Approximation |
163
click to vote
NIPS
2008
15 years 7 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
157
click to vote
IPCO
2001
15 years 7 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
156
click to vote
SODA
1997
ACM
15 years 7 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...
207
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
171
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...