SIGN IN
SIGN UP
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Full Text:
PDF
Buy this Article
Authors:
Christos Koufogiannakis
University of California, Riverside, Riverside, CA, USA
Neal E. Young
University of California, Riverside, Riverside, CA, USA
Published in:
· Proceeding
PODC '09
Proceedings of the 28th ACM symposium on Principles of distributed computing
Pages 171-179
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-396-9
doi>
10.1145/1582716.1582746
2009 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 39
· Downloads (cumulative): 266
· Citation Count: 8
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
computations on discrete structures
distributed covering
distributed vertex cover
graph algorithms
hypergraphs
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