Los puntos clave no están disponibles para este artículo en este momento.
par>We prove some non-approximability results for restrictions of basic combinatorial optimization problems to instances of bounded “degreeor bounded “width.” Specifically:
Luca Trevisan (Fri,) studied this question.