1. Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems

   • John E. Mitchell

   OriginalPaper Pages: 151 - 166

2. Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability

   • Daya Ram Gaur
   • Ramesh Krishnamurti

   OriginalPaper Pages: 167 - 173

3. Augmenting a Submodular and Posi-modular Set Function by a Multigraph

   • Hiroshi Nagamochi
   • Takashi Shiraki
   • Toshihide Ibaraki

   OriginalPaper Pages: 175 - 212

4. A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree

   • Tetsuo Asano
   • Naoki Katoh
   • Kazuhiro Kawashima

   OriginalPaper Pages: 213 - 231

5. Approximation Algorithms for Bounded Facility Location Problems

   • Piotr Krysta
   • Roberto Solis-Oba

   OriginalPaper Pages: 233 - 247

6. Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition

   • Yoshiyuki Kusakari
   • Daisuke Masubuchi
   • Takao Nishizeki

   OriginalPaper Pages: 249 - 266