Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

63

Voted

STOC
2003
ACM

favoriteEmaildiscussreport

86views Algorithms» more STOC 2003»

Meet and merge: approximation algorithms for confluent flows

16 years 8 hour ago

Meet and merge: approximation algorithms for confluent flows

Download ndssl.vbi.vt.edu

Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram

Real-time Traffic

Algorithms | Confluent Flows | STOC 2003 |

claim paper

Related Content

» Almost tight bounds and existence theorems for confluent flows

» Capacitated Confluent Flows Complexity and Algorithms

» Almost Tight bounds and existence theorems for singlecommodity confluent flows

» Optimizing Translation Out of SSA Using Renaming Constraints

» Finishing flows quickly with preemptive scheduling

» Multitarget Error Estimation and Adaptivity in Aerodynamic Flow Simulations

» Architectural Challenges in MemoryIntensive RealTime Image Forming

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram

Comments (0)