A two-pass sublinear-space streaming algorithm achieves (1/2-ε)-approximation for Max-DICUT on unbounded-degree graphs.
Non-approximability results for optimization problems on bounded degree instances
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
Presents hardness results and a sound, conditionally relatively complete verification/synthesis method for entropy objectives in MDPs via convex duality and invariant synthesis, with empirical evaluation on benchmarks.
citing papers explorer
-
Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes
A two-pass sublinear-space streaming algorithm achieves (1/2-ε)-approximation for Max-DICUT on unbounded-degree graphs.
-
Entropy Objectives in Markov Decision Processes
Presents hardness results and a sound, conditionally relatively complete verification/synthesis method for entropy objectives in MDPs via convex duality and invariant synthesis, with empirical evaluation on benchmarks.