Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
46
click to vote
WADS
2005
Springer
145
views
Algorithms
»
more
WADS 2005
»
Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length
14 years 4 months ago
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 »
23
click to vote
WADS
2005
Springer
57
views
Algorithms
»
more
WADS 2005
»
Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices
14 years 4 months ago
Download
www.csie.ntu.edu.tw
Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu
claim paper
Read More »
« first
‹ previous
1
2
3