Sciweavers

    CIAC
    2006
    Springer
    106views Algorithms» more  CIAC 2006»
    On the Hardness of Range Assignment Problems
    14 years 6 months ago
    On the Hardness of Range Assignment Problems
    Download  www.zpr.uni-koeln.de
    We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
    Bernhard Fuchs
    claim paper
    Read More »
    SOFSEM
    2007
    Springer
    142views Theoretical Computer Science» more  SOFSEM 2007»
    Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
    14 years 9 months ago
    Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
    Download  i11www.iti.uni-karlsruhe.de
    The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
    Markus Maier, Steffen Mecke, Dorothea Wagner
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.