Bibliography

1

C. Bornstein, A. Litman, B. Maggs, R. Sitaraman, and T. Yatzkar.
On the Bisection Width and Expansion of Butterfly Networks.
In Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP-98), pages 144-150. IEEE Computer Society, 1998.

2

L. Brunetta, M. Conforti, and G. Rinaldi.
A branch-and-cut algorithm for the equicut problem.
Mathematical Programming, 78:243-263, 1997.

3

J. Czyzyk, S. Mehrotra, M. Wagner, and S.J. Wright.
PCx user guide (Version 1.1).
Technical report, OptimizationTechnology Center, Aragone National Laboratory and Northwestern University, 1996.

4

J. Czyzyk, S. Mehrotra, M. Wagner, and S.J. Wright.
PCx: An interior-point code for linear programming.
Optimization Methods and Software, 11:397-430, 1999.

5

C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel, and L. A. Wolsey.
The node capacitated graph partitioning problem: a computational study.
Mathematical Programming, 81:229-256, 1998.

6

P.-O. Fjällström.
Algorithms for graph partitioning: A survey.
Linköping Electronic Articles in Computer and Information Science, 1998.

7

L. K. Fleischer.
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.
SIAM Journal on Discrete Mathematics, 13(4):505-520, 2000.

8

ILOG.
CPLEX 7.0 Reference Manual, 2000.

9

E. Johnson, A. Mehrotra, and G. Nemhauser.
Min-cut clustering.
Mathematical Programming, 62:133-151, 1993.

10

S. E. Karisch, F. Rendl, and J. Clausen.
Solving graph bisection problems with semidefinite programming.
INFORMS Journal on Computing, 12(3):177-191, 2000.

11

F. T. Leighton.
Introduction to Parallel Algorithms and Architectures.
Morgan Kaufman, 1992.

12

T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas.
Fast Approximation Algorithms for Multicommodity Flow Problems.
Journal of Computer and System Sciences, 50(2):228-243, 1995.

13

R. D. McBride.
Progress made in solving the multicommodity flow problem.
SIAM Journal on Optimization, 8:947-955, 1998.

14

K. Mehlhorn and S. Näher.
LEDA, a library of efficient data types and algorithms.
Technical report, University of Saarland, 1989.

15

R. Preis and R. Dieckmann.
The PARTY Partitioning - Library User Guide - Version 1.1.
SFB 376 tr-rsfb-96-024, University of Paderborn, 1996.

16

F. Shahrokhi and L. Szekely.
On canonical concurrent flows, crossing number and graph expansion.
Combinatorics, Probability and Computing, 3:523-543, 1994.

17

C. Souza, R. Keunings, L. A. Wolsey, and O. Zone.
A new approach to minimising the frontwidth in finite element calculations.
Computer Methods in Applied Mechanics and Engineering, 111:323-334, 1994.