SIGN IN
SIGN UP
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
Full Text:
Pdf
Buy this Article
Authors:
Shuchi Chawla
University of Wisconsin, Madison
Anupam Gupta
Carnegie Mellon University, Pittsburgh, PA
Harald Räcke
DIMAP and University of Warwick
Published in:
· Journal
ACM Transactions on Algorithms (TALG)
TALG Homepage
archive
Volume 4 Issue 2, May 2008
Article No. 22
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1361192.1361199
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 25
· Downloads (cumulative): 248
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation algorithm
embedding
general
metrics
negative-type metric
sparsest cut
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder