Approximate kernel clustering

Approximate Nearest Neighbor Search through Comparisons

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph

Approximate Tree Decompositions of Planar Graphs in Linear Time

Approximate Triangle Counting

Approximately Counting Embeddings into Random Graphs

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