Approximation algorithms for finding low-degree subgraphs. Klein, P. N.; Krishnan, R.; Raghavachari, B.; and Ravi, R. Networks, 44(3):203-215, 2004.
Link
Paper bibtex @article{journals/networks/KleinKRR04,
added-at = {2015-08-31T00:00:00.000+0200},
author = {Klein, Philip N. and Krishnan, Radha and Raghavachari, Balaji and Ravi, R.},
biburl = {http://www.bibsonomy.org/bibtex/29a343f3c1b7c7430ca4c449c6817a168/dblp},
ee = {http://dx.doi.org/10.1002/net.20031},
interhash = {9c02832b6837cbe35a8eff7432ebbea3},
intrahash = {9a343f3c1b7c7430ca4c449c6817a168},
journal = {Networks},
keywords = {dblp},
number = 3,
pages = {203-215},
timestamp = {2015-09-01T11:33:44.000+0200},
title = {Approximation algorithms for finding low-degree subgraphs.},
url = {http://dblp.uni-trier.de/db/journals/networks/networks44.html#KleinKRR04},
volume = 44,
year = 2004
}