MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Hardness and approximation of traffic grooming." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 1 documents found, showing 1 through 1.
ATOM RSS
  • Hardness and approximation of traffic grooming  
  • by Omid Amini, Stéphane Pérennes, Ignasi Sau, École Polytechnique Palaiseau — 2007 — In The 18th International Symposium on Algorithms and Computation (ISAAC 2007
  • …Hardness and Approximation of Traffic Grooming ⋆ Omid Amini 1,2 , Stéphane Pérennes 1 , and Ignasi…
  • Cited by 3 (0 self) – Add To MetaCart
Help! Showing 1 through 1.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB