MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "New Approximation Algorithms for the Steiner Tree Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 2 documents found, showing 1 through 2.
ATOM RSS
  • Lower bounds for approximation algorithms for the Steiner tree problem  
  • by Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel — 2001 — In: Proceedings of 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, Springer LNCS
  • … � �¢� � � �� � �� . Recently, a new approximation algorithm for the Steiner tree problem in quasi-bipartite graphs…
  • Cited by 4 (2 self) – Add To MetaCart
Help! Showing 1 through 2.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB