Balanced graph partitioning

Authors:
Konstantin Andreev;Harald Räcke
Affiliations:
Carnegie-Mellon University, Pittsburgh, PA;Carnegie-Mellon University, Pittsburgh, PA
Venue:
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2004

Citing 11
Cited 15

A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal

SIAM Journal on Computing
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
How Good is Recursive Bisection?

SIAM Journal on Scientific Computing
Fast Approximate Graph Partitioning Algorithms

SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Approximating the minimum bisection size (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Divide-and-conquer approximation algorithms via spreading metrics

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Polylogarithmic Approximation of the Minimum Bisection

SIAM Journal on Computing
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

A genetic algorithm for frequency assignment with problem decomposition

International Journal of Mobile Network Design and Innovation
Algorithms for the balanced edge partitioning problem

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Joint variable partitioning and bank selection instruction optimization on embedded systems with multiple memory banks

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Triangle listing in massive networks and its applications

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast algorithms for maximal clique enumeration with limited memory

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Entity Translation Mining: A Parallelized Graph Alignment Approach

ACM Transactions on Information Systems (TOIS)
Triangle listing in massive networks

ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
Self-stabilizing algorithm for maximal graph partitioning into triangles

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing algorithm for maximal graph decomposition into disjoint paths of fixed length

Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Joint variable partitioning and bank selection instruction optimization for partitioned memory architectures

ACM Transactions on Embedded Computing Systems (TECS)
Towards high-throughput gibbs sampling at scale: a study across storage managers

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
GraphBuilder: scalable graph ETL framework

First International Workshop on Graph Data Management Experiences and Systems
Distributed large-scale natural graph factorization

Proceedings of the 22nd international conference on World Wide Web
Efficient data partitioning model for heterogeneous graphs in the cloud

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
A constraint programming approach for integrated spatial and temporal scheduling for clustered architectures

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is the (2,1)-balanced partitioning problem. We present a bicriteria polynomial time approximation algorithm with an O(log2n)-approximation for any constant υ 1. For υ = 1 we show that no polytime approximation algorithm can guarantee a finite approximation ratio unless P=NP. Previous work has only considered the (k, υ)-balanced partitioning problem for υ ≥ 2.