|
|
Journals in DBLP
J. Algorithms
2001, volume: 39, number: 2
- Reuven Bar-Yehuda
Using Homogeneous Weights for Approximating the Partial Cover Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2001, v:39, n:2, pp:137-144 [Journal]
- Kazuo Iwama, Eiji Miyano
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2001, v:39, n:2, pp:145-161 [Journal]
- Gunnar Andersson, Lars Engebretsen, Johan Håstad
A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2001, v:39, n:2, pp:162-204 [Journal]
- J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2001, v:39, n:2, pp:205-222 [Journal]
- Barun Chandra, Magnús M. Halldórsson
Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2001, v:39, n:2, pp:223-240 [Journal]
|
