Approximation schemes for Metric Bisection and partitioning

We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of distances across the cut. The method extends to partitioning problems with arbitrary size constraints. Our approximation schemes depend on a hybrid placement method and on a new application of linearized quadratic programs.

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
• Keywords: Algorithms, Approximation Schemes, Finite Metric Space, SODA 2004, Time Approximation Schemes