First Page | Meta Content | |
---|---|---|
![]() | Document Date: 2004-10-18 03:25:13Open Document File Size: 256,55 KBShare Result on FacebookCityCambridge / /CompanyArtificial Intelligence Laboratory / /CountryUnited States / / /IndustryTermα-approximate solution / by-product / wireless ad-hoc network / fixed-parameter algorithms / auxiliary approximate solution / approximation algorithm / treewidthapproximation algorithms / enough bounded-treewidth algorithm / subexponential fixedparameter algorithms / far best approximation algorithm / real time / fixedparameter algorithm / machinery / polynomial-time algorithm / lighter / graph algorithms / subexponential fixed-parameter algorithms / approximation algorithms / parameter algorithm / fixed-parameter algorithm / subexponential algorithms / tree-decomposition algorithms / breadth-first search tree / vertices optimal solution / subexponential fixed-parameter algorithm / approximate solution / α-approximation algorithm / smallest / optimum solution / approximate solutions / ex400 haustive solution / not use existing exact tree-decomposition algorithms / /OrganizationMIT / /PersonCai / Chen / Williamson / Erik D. Demaine / /Positionalgorithmic designer / /ProgrammingLanguageTSP / /ProvinceOrStateMassachusetts / /Technologyfixedparameter algorithm / 6.1 Algorithm / APTAS algorithm / time algorithm / 2-approximation algorithms / enough bounded-treewidth algorithm / 5.2 Algorithm / treewidthapproximation algorithms / subexponential algorithms / previous fixed-parameter algorithms / α-approximation algorithm / graph algorithms / fixed-parameter algorithms / fixed-parameter algorithm / approximation algorithm / tree-decomposition algorithms / polynomial-time algorithm / 4.2 Algorithm / approximation algorithms / subexponential fixedparameter algorithms / subexponential fixed-parameter algorithm / parameter algorithm / Fixedparameter algorithms / subexponential fixed-parameter algorithms / /SocialTag |