Sciweavers

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

25

STOC
2006
ACM

favoriteEmaildiscussreport

77views Algorithms» more STOC 2006»

Graph partitioning using single commodity flows

14 years 11 months ago

Graph partitioning using single commodity flows

Download www.eecs.berkeley.edu

Rohit Khandekar, Satish Rao, Umesh V. Vazirani

Real-time Traffic

Algorithms | Single Commodity | STOC 2006 |

claim paper

Related Content

» Approximating the single source unsplittable mincost flow problem

» Single Source Multiroute Flows and Cuts on Uniform Capacity Networks

» Almost Tight bounds and existence theorems for singlecommodity confluent flows

» Capacitated Confluent Flows Complexity and Algorithms

» A Simple Greedy Algorithm for the kDisjoint Flow Problem

» Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow

» Multicommodity Flow Approximation Used for Exact Graph Partitioning

» Improving the WCET computation time by IPET using control flow graph partitioning

» Introducing scalability in network measurement toward 10 Gbps with commodity hardware

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Rohit Khandekar, Satish Rao, Umesh V. Vazirani

Comments (0)