Sciweavers

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

27

STOC
2007
ACM

favoriteEmaildiscussreport

154views Algorithms» more STOC 2007»

Improved approximation for directed cut problems

14 years 11 months ago

Improved approximation for directed cut problems

Download www.math.tau.ac.il

Amit Agarwal, Noga Alon, Moses Charikar

Real-time Traffic

Algorithms | Cut Problems | STOC 2007 |

claim paper

Related Content

» A Better Approximation Ratio for the Vertex Cover Problem

» An Improved Approximation Algorithm for Multiway Cut

» Approximation and Hardness Results for Label Cut and Related Problems

» Improved Approximation for the Directed Spanner Problem

» An Improved LPbased Approximation for Steiner Tree

» Embeddings of negativetype metrics and an improved approximation to generalized sparsest c...

» Improved Approximation of MAXCUT on Graphs of Bounded Degree

» Active Graph Cuts

» Fast Approximate Graph Partitioning Algorithms

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Amit Agarwal, Noga Alon, Moses Charikar

Comments (0)