Sciweavers

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

108

STOC
2007
ACM

91views Algorithms» more STOC 2007»

Polynomial flow-cut gaps and hardness of directed cut problems

16 years 3 months ago

Polynomial flow-cut gaps and hardness of directed cut problems

Download www.cis.upenn.edu

Julia Chuzhoy, Sanjeev Khanna

Real-time Traffic

Algorithms | Polynomial Flow-cut Gaps | STOC 2007 |

claim paper

Related Content

» Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems

» Beating the Random Ordering is Hard Inapproximability of Maximum Acyclic Subgraph

» Pure Nash equilibria complete characterization of hard and easy graphical games

» Approximating pure nash equilibrium in cut party affiliation and satisfiability games

» An Improved LPbased Approximation for Steiner Tree

» MaxMin allocation via degree lowerbounded arborescences

» Index coding via linear programming

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Julia Chuzhoy, Sanjeev Khanna

Comments (0)