Maximum coverage problem - PDFSEARCH.IO - Document Search Engine

Maximum coverage problem
Results: 9

#	Item
1	Budgeted Coverage of a Maximum Part of a Polygonal Area Euripides Markou1 , Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Mathematics Geometry Graph theory Polygons Computational geometry Euclidean plane geometry Art gallery problem Vertex Visibility graph Visibility polygon Pseudotriangle
2	Real-time Spatial Task Assignment for Weather Crowdsourcing Hien To, Liyue Fan, Luan Tran, Cyrus Shahabi {hto, liyuefan, luantran, shahabi}@usc.edu University of Southern California Add to Reading List Source URL: imsc.usc.edu Language: English - Date: 2015-04-06 12:57:07 HM NP-complete problems Maximum coverage problem Crowdsourcing
3	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
4	Multi-winner Social Choice with Incomplete Preferences Tyler Lu Craig Boutilier University of Toronto Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-04-27 18:03:22 Combinatorics Greedy algorithm Minimax Regret Preference Borda count Estimation theory Maximum coverage problem Mathematics Decision theory Discrete mathematics
5	Essential Web Pages Are Easy to Find Ricardo Baeza-Yates∗ Paolo Boldi† Flavio Chierichetti‡ Add to Reading List Source URL: labs.yahoo.com Language: English - Date: 2015-02-18 18:58:55 Applied mathematics Set cover problem Greedy algorithm Maximum coverage problem Algorithm Vertex cover Ordinal number Euclidean algorithm Dominating set Mathematics NP-complete problems Theoretical computer science
6	Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm Tasuku Soma TASUKU SOMA @ MIST. I . U - TOKYO . AC . JP Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, 113- Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2014-01-15 08:56:42 Order theory Submodular set function NP-complete problems Matroid theory Supermodular function Greedy algorithm Maximum coverage problem Approximation algorithm Static single assignment form Mathematics Mathematical analysis Mathematical optimization
7	Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm Tasuku Soma TASUKU SOMA @ MIST. I . U - TOKYO . AC . JP Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, 113- Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2014-01-10 18:43:39 Order theory Submodular set function NP-complete problems Matroid theory Supermodular function Greedy algorithm Maximum coverage problem Approximation algorithm Static single assignment form Mathematics Mathematical analysis Mathematical optimization
8	Cost-effective Outbreak Detection in Networks Jure Leskovec Andreas Krause Carlos Guestrin Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:52 NP-complete problems Submodular set function Greedy algorithm Maximum coverage problem Heuristic function Algorithm Mathematics Combinatorics Applied mathematics
9	Cost-effective Outbreak Detection in Networks Jure Leskovec Andreas Krause Carlos Guestrin Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-07-11 18:22:51 NP-complete problems Submodular set function Greedy algorithm Maximum coverage problem Heuristic function Algorithm Mathematics Combinatorics Applied mathematics