scientific article
From MaRDI portal
Publication:2768265
zbMath1018.90039MaRDI QIDQ2768265
Publication date: 15 September 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization ⋮ Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization ⋮ Constrained Submodular Maximization via a Nonsymmetric Technique ⋮ Online maximum directed cut ⋮ Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph ⋮ A combinatorial algorithm for MAX CSP ⋮ Online Submodular Maximization with Preemption ⋮ A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints ⋮ Oblivious algorithms for the maximum directed cut problem ⋮ Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
This page was built for publication:
