Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 6 of 26 found articles
 
 
  Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
 
 
Title: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
Author: Aazami, A.
Cheriyan, J.
Jampani, K. R.
Appeared in: Algorithmica
Paging: Volume 63 (2011) nr. 1-2 pages 425-456
Year: 2011
Contents:
Publisher: Springer-Verlag, New York
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 6 of 26 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands