Min-Max Graph Partitioning and Small Set Expansion
Work
Year: 2014
Type: article
Abstract: We study graph partitioning problems from a min-max perspective, in which an input graph on $n$ vertices should be partitioned into $k$ parts, and the objective is to minimize the maximum number of ed... more
Source: SIAM Journal on Computing
Authors Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan +2 more
Institutions Eindhoven University of Technology, Weizmann Institute of Science, Microsoft (United States), Technion – Israel Institute of Technology, IBM (United States)
Cites: 13
Cited by: 31
Related to: 10
FWCI: 3.414
Citation percentile (by year/subfield): 92.09
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green