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
81
click to vote
STOC
2003
ACM
86
views
Algorithms
»
more
STOC 2003
»
Meet and merge: approximation algorithms for confluent flows
16 years 3 months ago
Download
ndssl.vbi.vt.edu
Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
claim paper
Read More »
101
Voted
STOC
2004
ACM
131
views
Algorithms
»
more
STOC 2004
»
(Almost) tight bounds and existence theorems for confluent flows
16 years 3 months ago
Download
ndssl.vbi.vt.edu
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
claim paper
Read More »