Abstract
An improved approximation algorithm for the <inline-formula><tex-math id="M1">$ k $</tex-math></inline-formula>-prize-collecting minimum power cover problem
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
