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
64
click to vote
CIAC
2013
Springer
38
views
Algorithms
»
more
CIAC 2013
»
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
8 years 7 months ago
Download
www.cs.le.ac.uk
In network activation problems we are given a directed or undirected graph G = (V, E) with a family {fuv (xu, xv) : (u, v) ∈ E} of monotone non-decreasing activation functions fr...
Hasna Mohsen Alqahtani, Thomas Erlebach
claim paper
Read More »