Online Maximum Directed Cut

DOI10.1007/978-3-642-10631-6_113MaRDI QIDQ3652298zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Michael Lampis

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_113

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online maximum directed cut
• Maximizing Several Cuts Simultaneously
• Maximum directed cuts in acyclic digraphs
• Online Knapsack Problems with Limited Cuts
• Maximum directed cuts in graphs with degree constraints
• Approximating directed multicuts
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The maximum cut problem
• Computing maximum mean cuts
• Maximum directed cuts in digraphs with degree restriction

Cited in

(3)

• Oblivious algorithms for the maximum directed cut problem
• Intersection properties of maximal directed cuts in digraphs
• Online maximum directed cut

This page was built for publication: Online Maximum Directed Cut

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652298)