4894 search results - page 97 / 979 » The Guarding Problem - Complexity and Approximation |
168
click to vote
NIPS
2008
15 years 8 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...
168
click to vote
IPCO
2001
15 years 8 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...
169
click to vote
SODA
1997
ACM
15 years 8 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...
216
click to vote
FSTTCS
2003
Springer
15 years 12 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...
175
Voted
IFIP
2004
Springer
16 years 1 days 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...