Approximating acyclicity parameters of sparse hypergraphs

Approximating Clustering of Fingerprint Vectors with Missing Values

Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies

Approximating Edit Distance in Near-Linear Time

Approximating General Metric Distances Between a Pattern and a Text

Approximating Graphic TSP by Matchings

Approximating L1-distances between mixture distributions using random projections

Approximating Matrix p-norms

Approximating minimum-power edge-multicovers

Approximating Multi-Criteria Max-TSP

Approximating Scheduling Machines with Capacity Constraints

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 Influence of a monotone Boolean function in O(\sqrt{n}) query complexity