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 ≈

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Amotz Bar-Noy, Michael Lampis
• Keywords: Algorithms, Deterministic Algorithm, ISAAC 2009, Natural Online Version, Well-known Maximum