StringologyTimes

Data Structures and Algorithms: 2003/10/15-21

1: On the continuous Fermat-Weber problem
2: A combinatorial characterization of higher-dimensional orthogonal packing
3: Minimizing the stabbing number of matchings, trees, and triangulations
4: Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
5: Maximum dispersion and geometric maximum weight cliques