DocumentCode
2530751
Title
A randomized approximation scheme for metric MAX-CUT
Author
De la Vega, W. Fernandez ; Kenyon, Claire
Author_Institution
Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France
fYear
1998
fDate
8-11 Nov 1998
Firstpage
468
Lastpage
471
Abstract
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 has a polynomial time randomized approximation scheme
Keywords
computational geometry; polynomial approximation; randomised algorithms; metric MAX-CUT; polynomial time randomized approximation scheme; randomized approximation scheme; Algorithm design and analysis; Approximation algorithms; Clustering algorithms; Extraterrestrial measurements; Partitioning algorithms; Polynomials; Space exploration; Traveling salesman problems; Web pages; World Wide Web;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
Conference_Location
Palo Alto, CA
ISSN
0272-5428
Print_ISBN
0-8186-9172-7
Type
conf
DOI
10.1109/SFCS.1998.743497
Filename
743497
Link To Document