On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Peng Wang University of Delaware
Stephan Bohacek University of Delaware
Published in:
· Proceeding
WICON '08 Proceedings of the 4th Annual International Conference on Wireless Internet
Article No. 15
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) ICST, Brussels, Belgium, Belgium ©2008
table of contents ISBN: 978-963-9799-36-3
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 10
· Downloads (cumulative): 92
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder