%0 Journal Article %1 journals/algorithmica/CalinescuFKZ03 %A Calinescu, Gruia %A Fernandes, Cristina G. %A Karloff, Howard J. %A Zelikovsky, Alexander %D 2003 %J Algorithmica %K dblp %N 2 %P 179-205 %T A New Approximation Algorithm for Finding Heavy Planar Subgraphs. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica36.html#CalinescuFKZ03 %V 36

@article{journals/algorithmica/CalinescuFKZ03, added-at = {2018-11-30T00:00:00.000+0100}, author = {Calinescu, Gruia and Fernandes, Cristina G. and Karloff, Howard J. and Zelikovsky, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/23e99704b2e03f1c576925a888dd495f7/dblp}, ee = {https://doi.org/10.1007/s00453-002-1020-3}, interhash = {7f8a2a3ca96e729ae3cfe56573884449}, intrahash = {3e99704b2e03f1c576925a888dd495f7}, journal = {Algorithmica}, keywords = {dblp}, number = 2, pages = {179-205}, timestamp = {2018-12-01T11:39:30.000+0100}, title = {A New Approximation Algorithm for Finding Heavy Planar Subgraphs.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica36.html#CalinescuFKZ03}, volume = 36, year = 2003 }