1![THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai](https://www.pdfsearch.io/img/23a993fde3d13e57ad0305a9e8d93137.jpg) | Add to Reading ListSource URL: www.mathcs.emory.eduLanguage: English - Date: 2010-08-24 14:06:47
|
---|
2![An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt](https://www.pdfsearch.io/img/9c758176394f07cb1ad13924a90eb306.jpg) | Add to Reading ListSource URL: mmds-data.org- Date: 2016-06-23 15:50:48
|
---|
3![Minimum Common String Partition Problem: Hardness and Approximations Avraham Goldstein? , Petr Kolman?? , and Jie Zheng? ? ? Abstract. String comparison is a fundamental problem in computer science, with applications in Minimum Common String Partition Problem: Hardness and Approximations Avraham Goldstein? , Petr Kolman?? , and Jie Zheng? ? ? Abstract. String comparison is a fundamental problem in computer science, with applications in](https://www.pdfsearch.io/img/494cff871b34ec7c68afd101aff5e734.jpg) | Add to Reading ListSource URL: kam.mff.cuni.cz- Date: 2004-08-19 17:02:18
|
---|
4![The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗ The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗](https://www.pdfsearch.io/img/b8a50953ed1233a92344c8fe3087bee6.jpg) | Add to Reading ListSource URL: kam.mff.cuni.cz- Date: 2004-07-23 20:18:41
|
---|
5![Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 6, duepts total) Recall that the Kernighan-Lin heuristic begins with a random partition of the Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 6, duepts total) Recall that the Kernighan-Lin heuristic begins with a random partition of the](https://www.pdfsearch.io/img/fc6c5b55d5cf8781763fc28af2aaa238.jpg) | Add to Reading ListSource URL: tuvalu.santafe.edu- Date: 2013-11-23 11:09:30
|
---|
6![System Time Distribution of Dynamic Traveling Repairman Problem under the PART-n-TSP Policy Jiangchuan Huang and Raja Sengupta Abstract— We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1]. System Time Distribution of Dynamic Traveling Repairman Problem under the PART-n-TSP Policy Jiangchuan Huang and Raja Sengupta Abstract— We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1].](https://www.pdfsearch.io/img/a1dc952db0d98435eb049a3e7a86c0f1.jpg) | Add to Reading ListSource URL: cpcc.berkeley.eduLanguage: English - Date: 2016-06-12 17:08:37
|
---|
7![The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate](https://www.pdfsearch.io/img/033d91402573622e3b362b16c97959e6.jpg) | Add to Reading ListSource URL: users.cms.caltech.eduLanguage: English - Date: 2008-11-17 17:17:16
|
---|
8![CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22,](https://www.pdfsearch.io/img/0c44de9131731ca7b822b2a9cd86aab2.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2015-01-05 12:59:35
|
---|
9![An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt](https://www.pdfsearch.io/img/150fae7945a96f2715ae3ea891f8b132.jpg) | Add to Reading ListSource URL: mmds-data.orgLanguage: English - Date: 2016-06-23 15:50:48
|
---|
10![Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 5, duepts) Consider Price’s model of a citation network (Chapter 14.1 of Networks), applied to Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 5, duepts) Consider Price’s model of a citation network (Chapter 14.1 of Networks), applied to](https://www.pdfsearch.io/img/d54271de6dc320be6497d1603f10f4d7.jpg) | Add to Reading ListSource URL: tuvalu.santafe.eduLanguage: English - Date: 2013-11-23 11:09:29
|
---|