A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Journal of Algorithms
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Co-clustering documents and words using bipartite spectral graph partitioning
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
A Polylogarithmic Approximation of the Minimum Bisection
SIAM Journal on Computing
Finding a Maximum Density Subgraph
Finding a Maximum Density Subgraph
On the densest k-subgraph problems
On the densest k-subgraph problems
Improving graph partitions using submodular functions
Discrete Applied Mathematics - Submodularity
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Convex Optimization
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A fast kernel-based multilevel algorithm for graph clustering
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Optimal delivery of sponsored search advertisements subject to budget constraints
Proceedings of the 8th ACM conference on Electronic commerce
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
| Hi-index | 0.00 |
Methods for improving sponsored search revenue are often tested or deployed within a small submarket of the larger marketplace. For many applications, the ideal submarket contains a small number of nodes, a large amount of spending within the submarket, and a small amount of spending leaving the submarket. We introduce an efficient algorithm for finding submarkets that are optimal for a user-specified tradeoff between these three quantities. We apply our algorithm to find submarkets that are both dense and isolated in a large spending graph from Yahoo! sponsored search.