Online Maximum Directed Cut

13 years 11 months ago

Download web.cs.gc.cuny.edu

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

Real-time Traffic

Algorithms | Deterministic Algorithm | ISAAC 2009 | Natural Online Version | Well-known Maximum |

claim paper

» Clustering Pairwise Distances with Missing Data Maximum Cuts Versus Normalized Cuts

» Maximum flows and minimum cuts in the plane

» Beating the Random Ordering is Hard Inapproximability of Maximum Acyclic Subgraph

» Homology flows cohomology cuts

» Single Source Multiroute Flows and Cuts on Uniform Capacity Networks

» Dense Photometric Stereo Using a Mirror Sphere and Graph Cut

» TOPSAW Sawing Optimization Analysis Using Grid Computing

» OnLine Multicasting in AllOptical Networks

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Amotz Bar-Noy, Michael Lampis

Comments (0)

Sciweavers

Online Maximum Directed Cut

Algorithms | Deterministic Algorithm | ISAAC 2009 | Natural Online Version | Well-known Maximum |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers