A new approximation algorithm for finding heavy planar subgraphs (0)

by G Cǎlinescu, C G Fernandes, H Karloff, A Zelikovsky
Venue:Algorithmica