21 citations · 101 across the 20 of their papers we have counts for
3 papers · 1 filter
Submodular Functions: Learnability, Structure, and Optimization
Maria-Florina Balcan, Nicholas J. A. Harvey
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combina…
Graph Sparsification by Edge-Connectivity and Random Spanning Trees
Wai Shing Fung, Nicholas J. A. Harvey
We present new approaches to constructing graph sparsifiers --- weighted subgraphs for which every cut has the same value as the original graph, up to a factor of . Our…
The complexity of UNO
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey +3
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, includ…