Searching for "The Complexity of Polynomial-Time Approximation." – 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.

Fixed-parameter tractability results for feedback set problems in tournaments
by Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß — 2006 — In Proc. 6th CIAC, LNCS
…,guo,hueffner,niedermr,tanke}@(email omitted); Abstract. Complementing recent progress on classical complexity and polynomial-time approximability…
Cited by 10 (4 self) – Add To MetaCart

Showing 1 through 1.

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