1 citations · 1 across the 1 of their papers we have counts for
5 papers
Retrieving Top Weighted Triangles in Graphs
Raunak Kumar, Paul Liu, Moses Charikar +1
Pattern counting in graphs is a fundamental primitive for many network analysis tasks, and a number of methods have been developed for scaling subgraph counting to large graphs. Ma…
Submodular Optimization in the MapReduce Model
Paul Liu, Jan Vondrak
Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimizat…
A sampling framework for counting temporal motifs
Paul Liu, Austin Benson, Moses Charikar
Pattern counting in graphs is fundamental to network science tasks, and there are many scalable methods for approximating counts of small patterns, often called motifs, in large gr…
Greedy and Local Ratio Algorithms in the MapReduce Model
Nicholas J. A. Harvey, Christopher Liaw, Paul Liu
MapReduce has become the de facto standard model for designing distributed algorithms to process big data on a cluster. There has been considerable research on designing efficient…
Approximation Schemes for Covering and Packing in the Streaming Model
Christopher Liaw, Paul Liu, Robert Reiss
The shifting strategy, introduced by Hochbaum and Maass, and independently by Baker, is a unified framework for devising polynomial approximation schemes to NP-Hard problems. This…