Date: 2009-12-02 12:21:54

Spanning tree

Minimum spanning tree

Loop-erased random walk

Chernoff bound

Eulerian path

NP-complete problems

Dominating set

Holomorphic functional calculus

Graph theory

Mathematics

Theoretical computer science

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 710,84 KB