SIGN IN
SIGN UP
Minimizing weighted flow time
Full Text:
Pdf
Buy this Article
Authors:
N. Bansal
Carnegie Mellon University, Pittsburgh, PA
K. Dhamdhere
Carnegie Mellon University, Pittsburgh, PA
Published in:
· Proceeding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2003
table of contents
ISBN:0-89871-538-5
2003 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 7
· Citation Count: 6
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
graph algorithms
optimization
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