Change search
ReferencesLink to record
Permanent link

Direct link
Online Maximum Directed Cut
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2012 (English)In: Journal of combinatorial optimization, ISSN 1382-6905, E-ISSN 1573-2886, Vol. 24, no 1, 52-64 p.Article in journal (Refereed) Published
Abstract [en]

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 root 3/2 approximate to 2.5981. We then give a lower bound argument to show that no deterministic algorithm can achieve a ratio of 3 root 3/2 - epsilon for any epsilon > 0 thus showing that our algorithm is essentially optimal. Then, we extend our technique to improve upon the analysis of an old result: we show that greedily derandomizing the trivial randomized algorithm for MAXDICUT in general graphs improves the competitive ratio from 4 to 3, and also provide a tight example.

Place, publisher, year, edition, pages
2012. Vol. 24, no 1, 52-64 p.
Keyword [en]
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-58603DOI: 10.1007/s10878-010-9318-6ISI: 000304400600004OAI: diva2:473412

QC 20130204

Available from: 2012-01-05 Created: 2012-01-05 Last updated: 2013-02-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Lampis, Michael
By organisation
Theoretical Computer Science, TCS
In the same journal
Journal of combinatorial optimization
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 33 hits
ReferencesLink to record
Permanent link

Direct link