Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms.
Baoling NingJianzhong LiPublished in: CoRR (2024)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- constant factor
- special case
- graph partitioning
- disjoint paths
- vertex cover
- worst case
- minimum cost
- partitioning algorithm
- network design problem
- randomized algorithms
- approximation ratio
- set cover
- spanning tree
- min cut
- facility location problem
- constant factor approximation
- polynomial time approximation
- connected components
- np hardness
- primal dual
- open shop
- random walk
- precedence constraints
- weighted graph
- directed graph
- learning algorithm
- directed acyclic graph
- graph structure
- minimum weight
- bipartite graph
- approximation schemes