First Page | Document Content | |
---|---|---|
Date: 2014-11-26 08:32:22Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity | comput. complex), 281 – 040281–27 DOIs00037c Birkh¨Add to Reading ListSource URL: www.cs.huji.ac.ilDownload Document from Source WebsiteFile Size: 1,21 MBShare Document on Facebook |