Searching for "Approximating Bounded Degree Instances of NP-Hard Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Approximating Bounded Degree Instances of NP-Hard Problems
by Marek Karpinski — 2001 — Proc. 13th Symp. on Fundamentals of Computation Theory, LNCS 2138
…Approximating Bounded Degree Instances of NP-Hard Problems Marek Karpinski y Abstract We…
Cited by 8 (3 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB