๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A useful approximation scheme for Lagrangians

โœ Scribed by E. J. Balder


Publisher
Springer
Year
1989
Tongue
English
Weight
808 KB
Volume
61
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Randomized Approximation Scheme for Me
โœ W. Fernandez de la Vega; Claire Kenyon ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 113 KB

Metric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT is NP-complete but has a polynomial time randomized approximation scheme.