Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate - Polylogarithmic - Document - PDFSEARCH.IO

First Page	Meta Content
	Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate Add to Reading List Document Date: 2009-12-02 23:07:07 Open Document File Size: 112,87 KB Share Result on Facebook Company Caterpillar / / IndustryTerm approximation algorithm / approximation algorithms / polylogarithmic approximation algorithm / / Technology 8 Approximation algorithm / approximation algorithms / approximation algorithm / polylogarithmic approximation algorithm / / SocialTag Lepidoptera Polynomials Tree decomposition Approximation algorithm Caterpillar Polylogarithmic Theoretical computer science Graph theory Mathematics

Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximateAdd to Reading List