Searching for "The Approximation of Maximum Subgraph 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.

The Complexity Of The Optimal Spanning Hypertree Problem
by Marius Zimand, C. Papadimitriou, K. Steiglitz, Combinatorial Optimization Algorithms, I. Tomescu, Bonferroni Inequalities — 1993
…, 1993. [7] C. Lund and M. Yannakakis, The Approximation of Maximum Subgraph Problems 20th ICALP, 1993…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 1.

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