| Document Date: 2009-08-06 03:10:30
Open Document File Size: 358,61 KBShare Result on Facebook
Company Elsevier Science B. V. / Vertex / / Continent Europe / / Country Australia / / / Event Force Majeure / Reorganization / / Facility University Drive / Computer Science University of Newcastle / / IndustryTerm train systems / smart pre-processing / polynomial-time approximation algorithms / pre-processing routine / above nondeterministic algorithm / heuristic algorithm / brute force algorithm / nondeterministic algorithm / Local search / constant factor approximation algorithms / polynomial-time constant factor approximation algorithm / parallel processing system / computing / pre-processing / / OperatingSystem XP / / Organization School of Electrical Engineering / University of Newcastle / / Person Michael R. Fellows / Karsten Weihe / Cristina Bazgan / / Position player / / ProgrammingLanguage ML / TSP / / Technology FPT algorithm / parallel processing system / polynomial-time approximation algorithms / ANY algorithm / FPT algorithms / relational database / brute force algorithm / polynomial-time constant factor approximation algorithm / following nondeterministic algorithm / above nondeterministic algorithm / Polynomial-time constant factor approximation algorithms / / URL http /
SocialTag |
URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing