scientific article; zbMATH DE number 1496577

DOI<314::AID-RSA2>3.0.CO;2-E 10.1002/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-EzbMath0965.68072MaRDI QIDQ4500688

Wenceslas Fernandez de la Vega, Marek Karpinski

Publication date: 27 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation schemesrandomized algorithmsMAX-CUTdensity classes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Optimal cuts and partitions in tree metrics in polynomial time ⋮ A randomized approximation scheme for metric MAX-CUT

Cites Work

• Unnamed Item
• On the efficiency of polynomial time approximation schemes
• Quick approximation to matrices and applications
• Optimization, approximation, and complexity classes
• MAX-CUT has a randomized approximation scheme in dense graphs

This page was built for publication: