![Complexity classes / NP-complete problems / Mathematical optimization / Structural complexity theory / NP-complete / NP-hard / P versus NP problem / NP / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / NP-complete problems / Mathematical optimization / Structural complexity theory / NP-complete / NP-hard / P versus NP problem / NP / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/810a073700a317d0a83f1cade2be09c4.jpg)
| Document Date: 2013-06-19 07:39:31 Open Document File Size: 144,16 KBShare Result on Facebook
Currency pence / USD / / Facility The Clay Mathematics Institute / C library / / IndustryTerm polynomial time solution algorithm / cellphone network / online appendix / bound algorithms / software packages / approximate solutions / Online Appendices / e¢ cient graph theoretic algorithm / rst’search / / MarketIndex Minimum Cost / / Movie Not for Publication / / Organization Clay Mathematics Institute / / Person Mark Dean / Daniel Martin / / ProgrammingLanguage C / C++ / / ProvinceOrState Rhode Island / South Dakota / Minnesota / Alabama / Alaska / Wyoming / / Technology e¢ cient graph theoretic algorithm / 1 1 Algorithm / polynomial time solution algorithm / / URL www.gnu.org/software/glpk / /
SocialTag |