SIGN IN
SIGN UP
l
2
2
spreading metrics for vertex ordering problems
Full Text:
Pdf
Buy this Article
Authors:
Moses Charikar
Princeton University
Mohammad Taghi Hajiaghayi
MIT
Howard Karloff
AT&T Labs---Research
Satish Rao
UC Berkeley
2006 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 14
· Downloads (cumulative): 284
· Citation Count: 9
Published in:
· Proceeding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pages 1018 - 1027
ACM
New York, NY
, USA
©2006
table of contents
ISBN:0-89871-605-5
doi>
10.1145/1109557.1109670
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
graph algorithms
linear approximation
minimax approximation and algorithms
permutations and combinations
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