Journals in DBLP

Algorithmica
2003, volume: 38, number: 3

1. Klaus Jansen, Samir Khuller
   Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:415-416 [Journal]
   
2. Refael Hassin, R. Ravi, F. Sibel Salman
   Approximation Algorithms for a Capacitated Network Design Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:417-431 [Journal]
   
3. Kamal Jain, Vijay V. Vazirani
   An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:433-439 [Journal]
   
4. Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha
   Improved Approximations for Tour and Tree Covers. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:441-449 [Journal]
   
5. Venkatesan Guruswami
   Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:451-469 [Journal]
   
6. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum
   The Relative Complexity of Approximate Counting Problems. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:471-500 [Journal]
   
7. Sándor P. Fekete, Henk Meijer
   Maximum Dispersion and Geometric Maximum Weight Cliques. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2003, v:38, n:3, pp:501-511 [Journal]