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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
204
click to vote
CIAC
2013
Springer
38
views
Algorithms
»
more
CIAC 2013
»
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
9 years 11 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 »