SIGN IN
SIGN UP
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach
Full Text:
PDF
Buy this Article
Authors:
Baruch Awerbuch
Johns Hopkins University, Baltimore, MD
Rohit Khandekar
IBM T.J. Watson Research Center, Yorktown Heights
Published in:
· Proceeding
PODC '07
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Pages 354-355
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-616-5
doi>
10.1145/1281100.1281170
2007 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 11
· Downloads (cumulative): 110
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
distributed optimization
network measurements
nonnumerical algorithms and problems
packing and covering linear programs
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