Back to Results
First PageMeta Content
NP-complete problems / Tree / Clique / Path decomposition / Graph coloring / Graph theory / Theoretical computer science / Mathematics


Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized
Add to Reading List

Document Date: 2009-12-02 23:05:21


Open Document

File Size: 289,87 KB

Share Result on Facebook

Company

3SAT / Jet Propulsion Laboratory / Caterpillar / /

Currency

pence / /

Facility

Jet Propulsion Laboratory / /

IndustryTerm

randomized approximation algorithm / deterministic polynomial-time algorithm / approximation algorithm / different approximation algorithm / complicated algorithm / Another constant factor approximation algorithm / constant factor approximation algorithm / polylogarithmic approximation algorithm / rst polylogarithmic approximation algorithm / approximation algorithms / /

Person

Trees Abstract Bandwidth / /

Product

Gupta / /

Technology

Another constant factor approximation algorithm / randomized algorithm / constructively using approximation algorithms / 1.2 Approximation algorithms / randomized approximation algorithm / approximation algorithm / rst polylogarithmic approximation algorithm / approximation algorithms / different approximation algorithm / constant factor approximation algorithm / polylogarithmic approximation algorithm / deterministic polynomial-time algorithm / integrated circuit / /

SocialTag