Sciweavers

Share
ISAAC
2009
Springer

Online Maximum Directed Cut

10 years 4 days ago
Online Maximum Directed Cut
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio of 3 √ 3 2 ≈
Amotz Bar-Noy, Michael Lampis
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ISAAC
Authors Amotz Bar-Noy, Michael Lampis
Comments (0)
books