Tuesday, May 21

12:45-2:45 PM

Colwood
## CP30

Graph and Set Partitioning

**Eigenspace Relaxation for Graph k-Partitioning Problems**
- Chih-Chien Tu, Courant Institute of Mathematical Sciences, New York University
**Semidefinite Programming and Graph Equipartition**
- Stefan E. Karisch and Franz Rendl, Graz University of Technology, Austria
**Asymptotically Optimal Graph Partitioning**
- Robert R. Meyer and Ioannis T. Christou, University of Wisconsin, Madison
**Vertex Finding with Combinatorial Optimization in High Energy Physics**
- Jean-Francois Pusztaszeri, CERN; and Joseph Boudreau, University of Pittsburgh

*LMH, 2/28/96*