Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

DSpace/Manakin Repository

 
 
See more statistics about this item