Journals in DBLP
J. Algorithms 1998, volume: 27, number: 2
James Gary Propp , David Bruce Wilson How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:170-217 [Journal ] Claire Kenyon , Yuval Rabani , Alistair Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:218-235 [Journal ] Anil Kamath , Omri Palmon , Serge A. Plotkin Routing and Admission Control in General Topology Networks with Poisson Arrivals. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:236-258 [Journal ] Rina Panigrahy , Sundar Vishwanathan An O(log* n) Approximation Algorithm for the Asymmetric p -Center Problem. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:259-268 [Journal ] Gruia Calinescu , Cristina G. Fernandes , Ulrich Finkler , Howard J. Karloff A Better Approximation Algorithm for Finding Planar Subgraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:269-302 [Journal ] Christos Levcopoulos , Drago Krznaric Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:303-338 [Journal ] Robert Lupton , F. Miller Maley , Neal E. Young Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1998, v:27, n:2, pp:339-356 [Journal ]