Sciweavers

    WADS
    2005
    Springer
    145views Algorithms» more  WADS 2005»
    Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
    15 years 9 months ago
    Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
    Download  www.ulb.ac.be
    Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
    Victor Chepoi, Bertrand Estellon, Yann Vaxè...
    claim paper
    Read More »
    WADS
    2005
    Springer
    57views Algorithms» more  WADS 2005»
    Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices
    15 years 9 months ago
    Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices
    Download  www.csie.ntu.edu.tw
    Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
    claim paper
    Read More »
    « first‹ previous123
    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.