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

Source URL: www.mathcs.emory.edu

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

Source URL: mmds-data.org

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

Source URL: kam.mff.cuni.cz

The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗

Source URL: kam.mff.cuni.cz

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

Source URL: tuvalu.santafe.edu

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].

Source URL: cpcc.berkeley.edu

• Mathematics
• Discrete mathematics
• Combinatorics
• Operations research
• Travelling salesman problem
• TSP
• Partition
• Polling system

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

Source URL: users.cms.caltech.edu

• Mathematics
• Combinatorics
• Combinatorial optimization
• Matroid theory
• Discrete mathematics
• Matroid
• Greedoid
• Partition matroid
• Matroid oracle

CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22,

Source URL: theory.stanford.edu

• Graph theory
• Computational complexity theory
• Mathematics
• NP-complete problems
• Clique problem
• Planted clique
• Graph partition
• Graph coloring
• Clique
• Time complexity
• Maximal independent set
• Pathwidth

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

Source URL: mmds-data.org

• Submodular set function
• Reduction
• Economic model
• Algorithm
• Mathematics
• Mathematical optimization
• Cognitive science
• Theoretical computer science

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

Source URL: tuvalu.santafe.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Algebraic graph theory
• Network theory
• Modularity
• Connectivity
• Line graph
• Vertex
• Graph
• Networks
• Graph partition