Sciweavers

    WICON
    2008
    150views Computer Networks» more  WICON 2008»
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    15 years 4 months ago
    On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
    Download  udelmodels.eecis.udel.edu
    It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
    Peng Wang, Stephan Bohacek
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.