Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

67

ECCC
2002

favoriteEmaildiscussreport

79views more ECCC 2002»

On Approximability of Minimum Bisection Problem

14 years 9 months ago

On Approximability of Minimum Bisection Problem

Download www.newton.ac.uk

Marek Karpinski

Real-time Traffic

ECCC 2002 |

claim paper

Related Content

» A polylogarithmic approximation of the minimum bisection

» A Comparative Study of Linear and Semidefinite BranchandCut Methods for Solving the Minimu...

» Polynomial time approximation schemes for dense instances of NPhard problems

» Balanced graph partitioning

» Approximation of satisfactory bisection problems

» Spectral techniques for graph bisection in genetic algorithms

» A Note on Approximating MAXBISECTION on Regular Graphs

» Approximation schemes for Metric Bisection and partitioning

» Lasserre Hierarchy Higher Eigenvalues and Approximation Schemes for Quadratic Integer Prog...

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	ECCC
Authors	Marek Karpinski

Comments (0)