Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Satish Rao
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms
‹
1
2
Related publications
Fast Approximation Algorithms for Multicommodity Flow Problems
A Uniform Min-Max Theorem With Applications in Cryptography
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Reduced Graphs for Min-Cut/Max-Flow Approaches in Image Segmentation
Electronic Notes in Discrete Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Extension of Min/Max Flow Framework
Image and Vision Computing
Electrical
Computer Vision
Signal Processing
Pattern Recognition
Electronic Engineering
Clutters That Pack and the Max Flow Min Cut Property: A Conjecture
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximate Max K-Cut With Subgraph Guarantee
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
Centralized and Distributed Approximation Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
