𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the thirty-ninth annual ACM symposium - San Diego, California, USA (2007.06.11-2007.06.13)] Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 - Computing crossing number in linear time

✍ Scribed by Kawarabayashi, Ken-ichi; Reed, Buce


Book ID
121225990
Publisher
ACM Press
Year
2007
Weight
212 KB
Category
Article
ISBN
1595936319

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


[ACM Press the thirty-ninth annual ACM s
✍ Agarwal, Amit; Alon, Noga; Charikar, Moses S. πŸ“‚ Article πŸ“… 2007 πŸ› ACM Press βš– 265 KB

We present improved approximation algorithms for directed multicut and directed sparsest cut. The current best known approximation ratio for these problems is O(n 1/2 ). We obtain an Γ•(n 11/23 )-approximation. Our algorithm works with the natural LP relaxation used in prior work. We use a randomized