loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
39th Annual Symposium on Foundations of Computer Science
A Randomized Approximation Scheme for Metric MAX-CUT
Palo Alto, California
November 08-November 11
ISBN: 0-8186-9172-7
ASCII Text
x 
 
W. Fernandez de la Vega, Claire Kenyon, "A Randomized Approximation Scheme for Metric MAX-CUT," Foundations of Computer Science, IEEE Annual Symposium on, pp. 468, 39th Annual Symposium on Foundations of Computer Science, 1998.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.1998.743497,
author = {W. Fernandez de la Vega and Claire Kenyon},
title = {A Randomized Approximation Scheme for Metric MAX-CUT},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1998},
issn = {0272-5428},
pages = {468},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743497},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - A Randomized Approximation Scheme for Metric MAX-CUT
SN - 0272-5428
SP
EP
A1 - W. Fernandez de la Vega,
A1 - Claire Kenyon,
PY - 1998
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
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.
Citation:
W. Fernandez de la Vega, Claire Kenyon, "A Randomized Approximation Scheme for Metric MAX-CUT," focs, pp.468, 39th Annual Symposium on Foundations of Computer Science, 1998
Usage of this product signifies your acceptance of the Terms of Use.