Sciweavers

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

30

SODA
2003
ACM

favoriteEmaildiscussreport

121views Algorithms» more SODA 2003»

Improved results for directed multicut

14 years 7 days ago

Improved results for directed multicut

Download www.cs.cmu.edu

We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of Ç´ ÔÒÐÓ µ of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm.

Anupam Gupta

Real-time Traffic

Algorithms | MINIMUM DIRECTED MULTICUT | Simple Algorithm | SODA 2003 | Sophisticated Algorithm |

claim paper

Related Content

» Query Recommendation for Improving Search Engine Results

» The Checkpoint Problem

» On the effect of multiparents recombination in binary coded genetic algorithms

» Ratedistortion improvement of directional wavelets by megablocking

» CompilerDirected Dynamic Computation Reuse Rationale and Initial Results

» Further Results for Improving Loop Interchange in NonAdjacent and Imperfectly Nested Loops

» Reporting of standard cell placement results

» Subspacebased direction finding using transmit energy focusing in MIMO radar with colocate...

» A dynamicallyconstructed fuzzy neural controller for direct model reference adaptive contr...

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2003
Where	SODA
Authors	Anupam Gupta

Comments (0)