Sciweavers

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

8

IPL
2007

favoriteEmaildiscussreport

70views more IPL 2007»

An improved approximation ratio for the minimum linear arrangement problem

13 years 4 months ago

An improved approximation ratio for the minimum linear arrangement problem

Download www.cs.washington.edu

We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-linear arrangement problem. This improves over the O(log n)-approximation of Rao and Richa.

Uriel Feige, James R. Lee

Real-time Traffic

Arora | IPL 2007 | Minimum-linear Arrangement Problem | Vazirani |

claim paper

Related Content

» Minimumcost sensor arrangement for achieving wanted coverage lifetime

» Improved Approximation Algorithms for the Minimum Latency Problem via PrizeCollecting Stro...

» Inapproximability Results for Maximum Edge Biclique Minimum Linear Arrangement and Sparses...

» An effective twostage simulated annealing algorithm for the minimum linear arrangement pro...

» The minimum linear arrangement problem on proper interval graphs

» On the Approximability of the Steiner Tree Problem

» Better Approximations for the Minimum Common Integer Partition Problem

» Improved approximation algorithms for minimum ANDcircuits problem via kset cover

» Improved Approximation for the Directed Spanner Problem

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IPL
Authors	Uriel Feige, James R. Lee

Comments (0)