Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

Approximating Partition Functions of Two-State Spin Systems

Approximating Petri Net Reachability Along Context-free Traces

Approximating polynomial step response by equating characteristic equation coefficients

Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising

Approximating Scheduling Machines with Capacity Constraints

Approximating Spanning Trees with Low Crossing Number

Approximating Sparsest Cut in Graphs of Bounded Treewidth

Approximating Subdense Instances of Covering Problems

Approximating subset $k$-connectivity problems

Approximating the Balanced Minimum Evolution Problem

Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle

Approximating the Diameter of Planar Graphs in Near Linear Time

Approximating the Expansion Profile and Almost Optimal Local Graph Clustering

Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator

Approximating the Fréchet Distance for Realistic Curves in Near Linear Time

Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints

Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice

Approximating the minimum directed tree cover