Volume 35, Issue 3 | Algorithmica

Search all Algorithmica articles

Volume 35, Issue 3

March 2003

Filter by

Volume:

Sort by

Date published:

New to old Old to new

6 articles in this issue

Guest Editors' Foreword
Leong
Imai
OriginalPaper Pages: 193 - 193
Efficient Parallel Algorithms for Planar st-Graphs
Atallah
Chen
Daescu
OriginalPaper Pages: 194 - 215
An Approximation Algorithm for a Large-Scale Facility Location Problem
Kazuyoshi Hidaka
Hiroyuki Okano
OriginalPaper Pages: 216 - 224
Finding a Region with the Minimum Total L ₁ Distance from Prescribed Terminals
Yoshiyuki Kusakari
Takao Nishizeki
OriginalPaper Pages: 225 - 256
A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
Chung Keung Poon
Vijaya Ramachandran
OriginalPaper Pages: 257 - 268
A Characterization of Planar Graphs by Pseudo-Line Arrangements
Hisao Tamaki
Takeshi Tokuyama
OriginalPaper Pages: 269 - 285