The following pages link to Satish Rao (Q1330795):
Displaying 26 items.
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
- (Q1370852) (redirect page) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework (Q2933631) (← links)
- (Q2934686) (← links)
- Approximation Algorithms for Steiner and Directed Multicuts (Q3128195) (← links)
- (Q3128907) (← links)
- (Q4250986) (← links)
- Randomized Routing and Sorting on Fixed-Connection Networks (Q4304064) (← links)
- Work-preserving emulations of fixed-connection networks (Q4371700) (← links)
- Approximation schemes for Euclidean \(k\)-medians and related problems (Q4542527) (← links)
- (Q4542574) (← links)
- Local Flow Partitioning for Faster Edge Connectivity (Q4575872) (← links)
- (Q4598189) (← links)
- (Q4598191) (← links)
- Computing Vertex Connectivity: New Bounds from Old Techniques (Q4943077) (← links)
- Local Flow Partitioning for Faster Edge Connectivity (Q5210551) (← links)
- Approximate load balancing on dynamic and asynchronous networks (Q5248534) (← links)
- Excluded minors, network decomposition, and multicommodity flow (Q5248539) (← links)
- Faster shortest-path algorithms for planar graphs (Q5890838) (← links)
- Graph partitioning using single commodity flows (Q5891927) (← links)
- Expander flows, geometric embeddings and graph partitioning (Q5899507) (← links)
- Graph partitioning using single commodity flows (Q5899510) (← links)
- Expander flows, geometric embeddings and graph partitioning (Q5901073) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- Deterministic near-linear time minimum cut in weighted graphs (Q6645473) (← links)
