Revision as of 21:27, 4 September 2017 edit Mjsa (talk \| contribs) Extended confirmed users 534 edits Added use-case for sensor placement ← Previous edit		Revision as of 21:27, 4 September 2017 edit undo Mjsa (talk \| contribs) Extended confirmed users 534 edits m Citation style Next edit →
Line 34: The inapproximability results apply to all extensions of the maximum coverage problem since they hold the maximum coverage problem as a special case. The Maximum Coverage Problem can be applied to road traffic situations; one such example is selecting which bus routes in a public transportation network should be installed with pothole detectors to maximise coverage, when only a limited number of sensors is available. This problem is a known extension of the Maximum Coverage Problem and was first explored in literature by Junade Ali and Vladimir Dyo of the [[University of Bedfordshire]].<ref>{{cite journal\|last1=Ali\|first1=Junade\|last2=Dyo\|first2=Vladimir\|title=Coverage and Mobile Sensor Placement for Vehicles on Predetermined Routes: A Greedy Heuristic Approach\|journal=Proceedings of the 14th International Joint Conference on e-Business and Telecommunications\|date=2017\|volume=Volume 2: WINSYS\|pages=83-88\|doi=10.5220/0006469800830088\|url=http://www.scitepress.org/DigitalLibrary/PublicationsDetail.aspx?ID=ddWw1NMB3VI%3d}}</ref>. == Weighted version ==

Maximum coverage problem: Difference between revisions