Journals in DBLP
Algorithmica 1997, volume: 18, number: 1
Naveen Garg , Vijay V. Vazirani , Mihalis Yannakakis Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:3-20 [Journal ] R. Ravi , David P. Williamson An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:21-43 [Journal ] David Peleg , Gideon Schechtman , Avishai Wool Randomized Approximation of Bounded Multicovering Problems. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:44-66 [Journal ] Alan M. Frieze , Mark Jerrum Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:67-81 [Journal ] David R. Karger , Rajeev Motwani , G. D. S. Ramkumar On Approximating the Longest Path in a Graph. [Citation Graph (1, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:82-98 [Journal ] Alexander Zelikovsky A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem. [Citation Graph (1, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:99-110 [Journal ] Naveen Garg , Dorit S. Hochbaum An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:111-121 [Journal ] Flávio Keidi Miyazawa , Yoshiko Wakabayashi An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:122-144 [Journal ] Magnús M. Halldórsson , Jaikumar Radhakrishnan Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1997, v:18, n:1, pp:145-163 [Journal ]