4843 search results - page 91 / 969 » The Shortcut Problem - Complexity and Approximation |
SODA
1997
ACM
14 years 11 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...
112
click to vote
FSTTCS
2003
Springer
15 years 3 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...
IFIP
2004
Springer
15 years 3 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...
COR
2007
14 years 10 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
CRYPTO
2009
Springer
15 years 4 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...