First Page | Document Content | |
---|---|---|
![]() Date: 2014-02-11 03:59:44Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics | Source URL: web.eecs.umich.eduDownload Document from Source WebsiteFile Size: 620,37 KBShare Document on Facebook |