SIGN IN
SIGN UP
Distributed approximation of capacitated dominating sets
Full Text:
Pdf
Buy this Article
Authors:
Fabian Kuhn
ETH Zurich, Zurich, Switzerland
Thomas Moscibroda
Microsoft Research, Redmond, WA
Published in:
· Proceeding
SPAA '07
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Pages 161 - 170
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-667-7
doi>
10.1145/1248377.1248403
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 17
· Downloads (cumulative): 331
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
capacities
computations on discrete structures
distributed approximation
dominating sets
graph algorithms
lp relaxation
network problems
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